Lifting up the proof theory to the countables : Zermelo-Fraenkel set theory
classification
🧮 math.LO
keywords
theorycountableordinalszermelo-fraenkelboundcollapsingscountablesdefinable
read the original abstract
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.