The proof-theoretic analysis of transfinitely iterated fixed point theories

DOI10.2307/2586750zbMath0937.03065OpenAlexW2001118478MaRDI QIDQ4254619

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

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 systemiterated inductive definitionsmetapredicativitywell-ordering proofsfixed point theoriesgeneralized predicative methods

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Metamathematics of constructive systems (03F50) Recursive ordinals and ordinal notations (03F15)

Related Items (22)

An intensional fixed point theory over first order arithmetic ⋮ Wellordering proofs for metapredicative Mahlo ⋮ Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ A note on the theory SID<ω of stratified induction ⋮ The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice ⋮ Classes and truths in set theory ⋮ About Truth and Types ⋮ Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory ⋮ On the relationship between fixed points and iteration in admissible set theory without foundation ⋮ Universes in explicit mathematics ⋮ Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives ⋮ Feferman and the Truth ⋮ A flexible type system for the small Veblen ordinal ⋮ The proof-theoretic analysis of transfinitely iterated quasi least fixed points ⋮ Truth and the philosophy of mathematics ⋮ Reflections on reflections in explicit mathematics ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection ⋮ Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$ ⋮ A Note on (Meta)predicative Wellordering Proofs ⋮ Universes over Frege structures ⋮ Contextual-hierarchical reconstructions of the strengthened liar problem ⋮ Transfinite dependent choice and ω-model reflection

Cites Work

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

This page was built for publication: The proof-theoretic analysis of transfinitely iterated fixed point theories