On the relationship between fixed points and iteration in admissible set theory without foundation
From MaRDI portal
Publication:2486984
Recommendations
Cites work
- scientific article; zbMATH DE number 4039890 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3572133 (Why is no real title available?)
- scientific article; zbMATH DE number 2152230 (Why is no real title available?)
- On the relationship between ATR0 and
- Proof theory. An introduction
- Subsystems of second order arithmetic
- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
- The proof-theoretic analysis of transfinitely iterated fixed point theories
- The strength of admissibility without foundation
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- Variation on a theme of Schütte
- Wellordering proofs for metapredicative Mahlo
Cited in
(7)- scientific article; zbMATH DE number 4181325 (Why is no real title available?)
- The strength of admissibility without foundation
- scientific article; zbMATH DE number 2152230 (Why is no real title available?)
- Stage comparison, fixed points, and least fixed points in Kripke-Platek environments
- Fixed-points of Set-continuous Operators
- On non-wellfounded sets as fixed points of substitutions
- scientific article; zbMATH DE number 1420857 (Why is no real title available?)
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)