cs.LONov 11, 2026

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

Authors: Hans-Martin Will

Organizations: The Eigenius Project United States

Abstract

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 a 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 normalization and makes 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 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, ΠΠ-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, compile to unification-free checkers (A0,A1\mathcal{A}_0, \mathcal{A}_1), and match 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 support supp(j,P)supp(j,P), and embed Cooper's Type Theory with Records (TTR) for open-world knowledge graphs. Finally, we prove consistency in Grothendieck universes and mechanize the metatheory in Lean 4 with zero sorry axioms.

Figures & tables

Explore similar work

CardsList
  1. Eigenius: A Typed Knowledge-Graph DBMS with Epistemic Stratification and Institution-Mediated Reasoning

    Aug 5, 2026Hans-Martin Will, Allen L. Brown, Matthew FuchsData ProvenanceDependent Type Theory

  2. ProofSketcher: Hybrid LLM + Lightweight Proof Checker for Reliable Math/Logic Reasoning

    Apr 7, 2026Kranthi Kommuru, Kunal Khanvilkar, Gaurav ParekhLarge Language Model-Guided Theorem ProvingAutomated Theorem Proving