跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.15108 · v1

Typed Knowledge over Constructive Institutions: A Proof-Relevant Type Theory for Verified Science

首次提交 2026-11-11 14:35
版本更新 2026-11-11 14:35
雷达观测 2026-11-13 11:11
arXiv ↗PDF ↗

摘要

Mathematical proof assistants such as Coq, Agda, and Lean 4 build proof irrelevance into definitional conversion (p≡qp \equiv q for p,q:Pp, q : P with P:PropP : Prop), erasing which derivation established a theorem. While natural for mathematics over fixed axioms, judgmental proof irrelevance is incompatible with verified scientific stores, which must inspect and compare independent derivations of the same claim to assess consilience and compute counterfactual retractions when an assay, reagent, or model is invalidated. Moreover, combining definitional proof irrelevance with subsingleton elimination breaks strong normalization and renders algorithmic conversion non-transitive. We present the type-theoretic and institutional foundations of Eigenius, a verified knowledge substrate for science. First, we formulate a dependent kernel with cumulative universes (Prop,Set,TypekProp, Set, Type_k), impredicative PropProp, inductive families with index-forced subsingleton elimination, and intensional identity types, where definitional equality ≡\equiv is untyped joinability under an orthogonal CRS and proof irrelevance is a witnessed propositional axiom (irrel:ΠP:Prop. Πp,q:P. Id P p qirrel : ΠP{:}Prop.\,Πp,q{:}P.\,Id\,P\,p\,q). Second, we unify universe cumulativity, codomain-covariant ΠΠ-subtyping, and ontology class inclusions in a coercion-free subsumption judgment whose bidirectional fragments (K0,K1\mathcal{K}_0, \mathcal{K}_1) satisfy subject reduction and are sound and complete for declarative typing. Third, we organize external verifiers into a three-level institutional hierarchy with explicit axiom policies (Adopt, Discharge, Relativize), internalize a justification logic with Why-provenance semiring support supp(j,P)supp(j,P), and embed Cooper's Type Theory with Records (TTR) to type open-world knowledge graphs. Finally, we prove consistency in Grothendieck universes and mechanize the metatheory in Lean 4 with zero sorry axioms.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-11 14:35 · 最新观测版本

Typed Knowledge over Constructive Institutions: A Proof-Relevant Type Theory for Verified Science

Mathematical proof assistants such as Coq, Agda, and Lean 4 build proof irrelevance into definitional conversion (p≡qp \equiv q for p,q:Pp, q : P with P:PropP : Prop), erasing which derivation established a theorem. While natural for mathematics over fixed axioms, judgmental proof irrelevance is incompatible with verified scientific stores, which must inspect and compare independent derivations of the same claim to assess consilience and compute counterfactual retractions when an assay, reagent, or model is invalidated. Moreover, combining definitional proof irrelevance with subsingleton elimination breaks strong normalization and renders algorithmic conversion non-transitive. We present the type-theoretic and institutional foundations of Eigenius, a verified knowledge substrate for science. First, we formulate a dependent kernel with cumulative universes (Prop,Set,TypekProp, Set, Type_k), impredicative PropProp, inductive families with index-forced subsingleton elimination, and intensional identity types, where definitional equality ≡\equiv is untyped joinability under an orthogonal CRS and proof irrelevance is a witnessed propositional axiom (irrel:ΠP:Prop. Πp,q:P. Id P p qirrel : ΠP{:}Prop.\,Πp,q{:}P.\,Id\,P\,p\,q). Second, we unify universe cumulativity, codomain-covariant ΠΠ-subtyping, and ontology class inclusions in a coercion-free subsumption judgment whose bidirectional fragments (K0,K1\mathcal{K}_0, \mathcal{K}_1) satisfy subject reduction and are sound and complete for declarative typing. Third, we organize external verifiers into a three-level institutional hierarchy with explicit axiom policies (Adopt, Discharge, Relativize), internalize a justification logic with Why-provenance semiring support supp(j,P)supp(j,P), and embed Cooper's Type Theory with Records (TTR) to type open-world knowledge graphs. Finally, we prove consistency in Grothendieck universes and mechanize the metatheory in Lean 4 with zero sorry axioms.

查看此版本解读 →查看此版本原文 ↗