arXiv Analytics

Sign in

arXiv:1610.02191 [math.LO]AbstractReferencesReviewsResources

Proof Theory of Constructive Systems: Inductive Types and Univalence

Michael Rathjen

Published 2016-10-07Version 1

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set theory. Proof theory has contributed to a deeper grasp of the relationship between different frameworks for constructive mathematics. Some of the reductions are known only through ordinal-theoretic characterizations. The paper also addresses the strength of Voevodsky's univalence axiom. A further goal is to investigate the strength of intuitionistic theories of generalized inductive definitions in the framework of intuitionistic explicit mathematics that lie beyond the reach of Martin-Lof type theory.

Related articles: Most relevant | Search more
arXiv:2003.13207 [math.LO] (Published 2020-03-30)
Two remarks on proof theory of first-order arithmetic
arXiv:2209.08976 [math.LO] (Published 2022-09-19)
Proof Theory for Lax Logic
arXiv:1007.0844 [math.LO] (Published 2010-07-06)
Proof theory for theories of ordinals III: $Π_{N}$-reflection