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

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,090

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
52 (#436,142)

6 months
2 (#1,302,720)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrea Cantini
Università degli Studi di Firenze

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Second order arithmetic and related topics.K. R. Apt & W. Marek - 1974 - Annals of Mathematical Logic 6 (3):177.
Recursive Function Theory and Logic.Ann Yasuhara - 1975 - Journal of Symbolic Logic 40 (4):619-620.

Add more references