Metraipolis › archive › dc_103d2deb2625
Typed Knowledge over Constructive Institutions — arXiv:2611.07432
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.07432
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-06T14:42:22.281Z
- SHA-256 of the archived text
c2b27401251873f054552d7c2818d54c940f6c0790c0521f6798c7d414d85cae- Stable URL of this page
https://metraipolis.com/documento/dc_103d2deb2625
How to cite
Typed Knowledge over Constructive Institutions — arXiv:2611.07432 — arXiv (en), https://arxiv.org/abs/2611.07432 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_103d2deb2625 (Metraipolis archive dc_103d2deb2625, sha256 c2b27401251873f054552d7c2818d54c940f6c0790c0521f6798c7d414d85cae)
BibTeX
@misc{dc103d2deb2625,
title = {Typed Knowledge over Constructive Institutions — arXiv:2611.07432},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.07432},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_103d2deb2625; sha256 c2b27401251873f054552d7c2818d54c940f6c0790c0521f6798c7d414d85cae},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07432. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Type theories designed for mathematics or program verification need only that a proposition holds; proof irrelevance in conversion erases, at the kernel level, how a claim was established. A persistent knowledge store, by contrast, must retain that record: who established a claim, by which derivation or external tool, and under which assumptions. This volume presents the theory of Eigenius---a store of typed knowledge over constructive institutions---and develops its metatheory from that requirement. The kernel theory is a dependent type theory with cumulative universes, an impredicative universe of propositions, inductive families, and an intensional identity type. Proof irrelevance is an axiom with an explicit witness rather than a conversion rule, so proofs of a proposition are provably equal yet remain distinct terms. Definitional equality is joinability under an orthogonal rewriting system---confluent, injective on type formers, and decidable by a type-free test---while a separate subsumption judgment covers universe cumulativity, codomain-covariant function types, and declared class inclusions. We prove consistency via a set-theoretic model; develop a justification logic over the kernel's propositions to track evidence and support; organize environments as an institution so that store extensions are signature morphisms and external verdicts enter via comorphisms; formulate a typed knowledge-graph theory with records, classes, and refinements; and prove the correctness of conversion, normalization by evaluation, and bidirectional type checking relative to termination. A Lean 4 formalization accompanies the volume. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI); Databases (cs.DB). Pagina del lavoro: https://arxiv.org/abs/2611.07432 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-06T14:18:42.675Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).