Counterexamples to countable-section Π 2 1 uniformization and Π 3 1 separation

&
Annals of Pure and Applied Logic 167 (3):262-283 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.12.002

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: 106,211

External links

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

Through your library

My notes

Similar books and articles

Forcing the Π 3 1 -reduction property and a failure of Π 3 1 -uniformization.Stefan Hoffelner - 2023 - Annals of Pure and Applied Logic 174 (8):103292.
Computational inductive definability.Dexter Kozen - 2004 - Annals of Pure and Applied Logic 126 (1-3):139-148.
Π 2 1 -Logic and uniformization in the analytical hierarchy.J. P. Ressayre - 1989 - Archive for Mathematical Logic 28 (2):99-117.
Exponentiation and second-order bounded arithmetic.Jan Krajíček - 1990 - Annals of Pure and Applied Logic 48 (3):261-276.
The members of thin and minimal Π 1 0 classes, their ranks and Turing degrees.Rodney G. Downey, Guohua Wu & Yue Yang - 2015 - Annals of Pure and Applied Logic 166 (7-8):755-766.
Notes on some second-order systems of iterated inductive definitions and Π 1 1 -comprehensions and relevant subsystems of set theory. [REVIEW]Kentaro Fujimoto - 2015 - Annals of Pure and Applied Logic 166 (4):409-463.
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π 1 -equivalent to KP.Kentaro Sato & Rico Zumbrunnen - 2015 - Annals of Pure and Applied Logic 166 (2):121-186.
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
An extension of borel determinacy.Donald A. Martin - 1990 - Annals of Pure and Applied Logic 49 (3):279-293.
The determinacy strength of Π 2 1 -comprehension.Christoph Heinatsch & Michael Möllerfeld - 2010 - Annals of Pure and Applied Logic 161 (12):1462-1470.

Analytics

Added to PP
2016-02-04

Downloads
32 (#786,773)

6 months
8 (#521,746)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Definable E 0 classes at arbitrary projective levels.Vladimir Kanovei & Vassily Lyubetsky - 2018 - Annals of Pure and Applied Logic 169 (9):851-871.

Add more citations

References found in this work

[Omnibus Review].Thomas Jech - 1992 - Journal of Symbolic Logic 57 (1):261-262.
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.
A definable E 0 class containing no definable elements.Vladimir Kanovei & Vassily Lyubetsky - 2015 - Archive for Mathematical Logic 54 (5-6):711-723.
Projective uniformization revisited.Kai Hauser & Ralf-Dieter Schindler - 2000 - Annals of Pure and Applied Logic 103 (1-3):109-153.

View all 6 references / Add more references