The proof-theoretic analysis of transfinitely iterated quasi least fixed points

DOI10.2178/JSL/1154698573zbMath1115.03084OpenAlexW2100886701MaRDI QIDQ3410669

Dieter Probst

Publication date: 29 November 2006

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

Full work available at URL: https://boris.unibe.ch/19387/1/S0022481200005880.pdf

zbMATH Keywords

IterationFixed-point theoriesPseudo-hierarchies

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35)

Related Items (6)

A note on the theory SID<ω of stratified induction ⋮ A note on the theory of positive induction, \({{\text{ID}}^*_1}\) ⋮ An ordinal analysis for theories of self-referential truth ⋮ PROOF-THEORETIC STRENGTHS OF WEAK THEORIES FOR POSITIVE INDUCTIVE DEFINITIONS ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ A flexible type system for the small Veblen ordinal

Cites Work

• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• The proof-theoretic analysis of transfinitely iterated fixed point theories
• Variation on a theme of Schütte

This page was built for publication: The proof-theoretic analysis of transfinitely iterated quasi least fixed points