The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
From MaRDI portal
Publication:1400604
DOI10.1016/S0168-0072(03)00006-XzbMath1032.03051MaRDI QIDQ1400604
Publication date: 13 August 2003
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Second- and higher-order arithmetic and fragments (03F35) Proof theory in general (including proof-theoretic semantics) (03F03) Recursive ordinals and ordinal notations (03F15)
Related Items (3)
A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ On the relationship between fixed points and iteration in admissible set theory without foundation ⋮ Reflections on reflections in explicit mathematics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed point theories and dependent choice
- The strength of Martin-Löf type theory with a superuniverse. I
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join
- Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- On the relation between choice and comprehension principles in second order arithmetic
- Reflecting on incompleteness
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- Wellordering proofs for metapredicative Mahlo
- Transfinite dependent choice and ω-model reflection
- On the relationship between ATR0 and
This page was built for publication: The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice