arXiv Analytics

Sign in

arXiv:1101.5660 [math.LO]AbstractReferencesReviewsResources

Lifting up the proof theory to the countables : Zermelo-Fraenkel set theory

Toshiyasu Arai

Published 2011-01-29, updated 2013-03-11Version 5

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.

Categories: math.LO
Subjects: 03F03
Related articles: Most relevant | Search more
arXiv:1102.0596 [math.LO] (Published 2011-02-03)
A sneak preview of proof theory of ordinals
arXiv:2003.13207 [math.LO] (Published 2020-03-30)
Two remarks on proof theory of first-order arithmetic
arXiv:1308.1696 [math.LO] (Published 2013-08-07)
An Easton-like Theorem for Zermelo-Fraenkel Set Theory Without Choice (Preliminary Report)

Links

Toolbox