On the Π1 1 -separation principle

Mathematical Logic Quarterly 54 (6):563-578 (2008)
  Copy   BIBTEX

Abstract

We study the proof-theoretic strength of the Π11-separation axiom scheme, and we show that Π11-separation lies strictly in between the Δ11-comprehension and Σ11-choice axiom schemes over RCA0

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
17 (#846,424)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Indecomposable linear orderings and hyperarithmetic analysis.Antonio Montalbán - 2006 - Journal of Mathematical Logic 6 (1):89-120.
The Axiom of Choice and the Class of Hyperarithmetic Functions.G. Kreisel - 1970 - Journal of Symbolic Logic 35 (2):333-334.
Forcing with tagged trees.John R. Steel - 1978 - Annals of Mathematical Logic 15 (1):55.
Proof of Mostowski's Conjecture.R. O. Gandy - 1964 - Journal of Symbolic Logic 29 (2):103-104.
Hyperarithmetical Quantifiers.C. Spector & Shih-Chao Liu - 1966 - Journal of Symbolic Logic 31 (1):137-137.

View all 7 references / Add more references