On the relationship between fixed points and iteration in admissible set theory without foundation
DOI10.1007/S00153-004-0251-1zbMATH Open1073.03029OpenAlexW2028238193MaRDI QIDQ2486984FDOQ2486984
Authors: D. Probst 
Publication date: 17 August 2005
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://boris.unibe.ch/118090/1/153_2004_Article_251.pdf
Recommendations
fixed pointsiterationadmissible setsproof-theoretic ordinalpseudo-hierarchiesmetapredicative Mahlo ordinalsubsystems of set theory without foundation
Nonclassical and second-order set theories (03E70) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)
Cites Work
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- Subsystems of second order arithmetic
- Proof theory. An introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- On the relationship between ATR0 and
- Variation on a theme of Schütte
- Title not available (Why is that?)
- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
- Wellordering proofs for metapredicative Mahlo
- The strength of admissibility without foundation
Cited In (7)
- Stage comparison, fixed points, and least fixed points in Kripke-Platek environments
- On non-wellfounded sets as fixed points of substitutions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The strength of admissibility without foundation
- Fixed-points of Set-continuous Operators
This page was built for publication: On the relationship between fixed points and iteration in admissible set theory without foundation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486984)
