Fixed point theories and dependent choice

DOI10.1007/S001530050161MaRDI QIDQ1590660zbMATH OpenOpenAlexFDO

Authors Gerhard Jäger, Thomas Strahm

Publication date 13 March 2001

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001530050161

zbMATH Keywords

fixed pointssecond-order arithmeticarithmetical transfinite recursiondependent choice

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Recommendations

• On the relationship between ATR₀ and
• The proof-theoretic analysis of transfinitely iterated fixed point theories
• About the proof-theoretic ordinals of weak fixed point theories
• Ranked structures and arithmetic transfinite recursion
• The proof-theoretic analysis of transfinitely iterated quasi least fixed points

Cited in

(8)

• The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
• scientific article; zbMATH DE number 1420857 (Why is no real title available?)
• Forcing for hat inductive definitions in arithmetic
• About the proof-theoretic ordinals of weak fixed point theories
• Full and hat inductive definitions are equivalent in NBG
• Wellordering proofs for metapredicative Mahlo
• Transfinite dependent choice and ω-model reflection
• Some results on cut-elimination, provable well-orderings, induction and reflection

This page was built for publication: Fixed point theories and dependent choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1590660)