On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic
Cantini, Andrea
J. Symbolic Logic, Tome 51 (1986) no. 1, p. 360-373 / Harvested from Project Euclid
We give a new elementary proof of the comparison theorem relating $\sum^1_{n + 1}-\mathrm{AC}\uparrow$ and $\Pi^1_n -\mathrm{CA}\uparrow$; the proof does not use Skolem theories. By the same method we prove: a) $\sum^1_{n + 1}-\mathrm{DC} \uparrow \equiv (\Pi^1_n -CA)_{<\omega^\omega} \uparrow$, for suitable classes of sentences; b) $\sum^1_{n+1}-DC \uparrow$ proves the consistency of $(\Pi^1_n -CA)_\omega k$, for finite $k$, and hence is stronger than $\sum^1_{n+1}-AC \uparrow$. a) and b) answer a question of Feferman and Sieg.
Publié le : 1986-06-14
Classification: 
@article{1183742101,
     author = {Cantini, Andrea},
     title = {On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic},
     journal = {J. Symbolic Logic},
     volume = {51},
     number = {1},
     year = {1986},
     pages = { 360-373},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183742101}
}
Cantini, Andrea. On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic. J. Symbolic Logic, Tome 51 (1986) no. 1, pp.  360-373. http://gdmltest.u-ga.fr/item/1183742101/