PREDICATIVE COLLAPSING PRINCIPLES
AbstractWe show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal α there exists an ordinal β such that $1 + \beta \cdot \left( {\beta + \alpha } \right)$ (ordinal arithmetic) admits an almost order preserving collapse into β. Arithmetical comprehension is equivalent to a statement of the same form, with $\beta \cdot \alpha$ at the place of $\beta \cdot \left( {\beta + \alpha } \right)$. We will also characterize the principles that any set is contained in a countable coded ω-model of arithmetical transfinite recursion and arithmetical comprehension, respectively.
Keyword(s):
Keyword(s):
1969 ◽
Vol 27
◽
pp. 160-161
1983 ◽
Vol 41
◽
pp. 708-709
1974 ◽
Vol 32
◽
pp. 436-437
1978 ◽
Vol 36
(1)
◽
pp. 548-549
◽
1978 ◽
Vol 36
(1)
◽
pp. 540-541
1978 ◽
Vol 36
(1)
◽
pp. 456-457
1988 ◽
Vol 46
◽
pp. 218-219
1978 ◽
Vol 36
(1)
◽
pp. 176-177
Keyword(s):