Fixed point theories and dependent choice

DOI10.1007/S001530050161zbMath0956.03051OpenAlexW2010039716MaRDI QIDQ1590660

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)

Related Items (6)

Wellordering proofs for metapredicative Mahlo ⋮ Forcing for hat inductive definitions in arithmetic ⋮ The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice ⋮ Full and hat inductive definitions are equivalent in NBG ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection ⋮ Transfinite dependent choice and ω-model reflection

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