The proof-theoretic analysis of transfinitely iterated fixed point theories

DOI10.2307/2586750zbMath0937.03065MaRDI QIDQ4254619

Gerhard Jäger, Reinhard Kahle, Anton Setzer, Thomas Strahm

Publication date: 16 September 1999

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/115095/1/S002248120001389X.pdf

zbMATH Keywords

ordinal notation system; iterated inductive definitions; metapredicativity; well-ordering proofs; fixed point theories; generalized predicative methods

Mathematics Subject Classification ID

03F05: Cut-elimination and normal-form theorems

03F50: Metamathematics of constructive systems

03F15: Recursive ordinals and ordinal notations

Related Items

Wellordering proofs for metapredicative Mahlo, Transfinite dependent choice and ω-model reflection, Universes in explicit mathematics, Some results on cut-elimination, provable well-orderings, induction and reflection, The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice, Universes over Frege structures, An intensional fixed point theory over first order arithmetic, On the relationship between fixed points and iteration in admissible set theory without foundation, Reflections on reflections in explicit mathematics, Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory, The proof-theoretic analysis of transfinitely iterated quasi least fixed points

Cites Work

• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies