On the relation between choice and comprehension principles in second order arithmetic

Journal of Symbolic Logic 51 (2):360-373 (1986)
  Copy   BIBTEX

Abstract

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)_{, for suitable classes of sentences; b) $\sum^1_{n+1}-DC \uparrow$ proves the consistency of (Π 1 n -CA) ω 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.

Other Versions

No versions found

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
144 (#299,093)

6 months
37 (#234,823)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrea Cantini
Università degli Studi di Firenze

Citations of this work

Derivatives of normal functions in reverse mathematics.Anton Freund & Michael Rathjen - 2021 - Annals of Pure and Applied Logic 172 (2):102890.
Σ11 Choice in a Theory of Sets and Classes.Gerhard Jäger & Jürg Krähenbühl - 2010 - In Ralf Schindler, Ways of Proof Theory. Berlin, Boston: De Gruyter. pp. 283-314.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.

View all 16 citations / Add more citations