Borel quasi-orderings in subsystems of second-order arithmetic

Annals of Pure and Applied Logic 54 (3):265-291 (1991)
  Copy   BIBTEX

Abstract

We study the provability in subsystems of second-order arithmetic of two theorems of Harrington and Shelah [6] about Borel quasi-orderings of the reals. These theorems turn out to be provable in ATR0, thus giving further evidence to the observation that ATR0 is the minimal subsystem of second-order arithmetic in which significant portion of descriptive set theory can be developed. As in [6] considering the lightface versions of the theorems will be instrumental in their proof and the main techniques employed will be the reflection principles and Gandy forcing

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(91)90050-v

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

My notes

Similar books and articles

Riesz representation theorem, Borel measures and subsystems of second-order arithmetic.Xiaokang Yu - 1993 - Annals of Pure and Applied Logic 59 (1):65-78.
A quasi-order on continuous functions.Raphaël Carroy - 2013 - Journal of Symbolic Logic 78 (2):633-648.
Review: Jeremy Avigad, Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Fundamental notions of analysis in subsystems of second-order arithmetic.Jeremy Avigad - 2006 - Annals of Pure and Applied Logic 139 (1):138-184.
The baire category theorem in weak subsystems of second-order arithmetic.Douglas K. Brown & Stephen G. Simpson - 1993 - Journal of Symbolic Logic 58 (2):557-578.
Second order theories with ordinals and elementary comprehension.Gerhard Jäger & Thomas Strahm - 1995 - Archive for Mathematical Logic 34 (6):345-375.
On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
The role of parameters in bar rule and bar induction.Michael Rathjen - 1991 - Journal of Symbolic Logic 56 (2):715-730.
Lebesgue numbers and Atsuji spaces in subsystems of second-order arithmetic.Mariagnese Giusto & Alberto Marcone - 1998 - Archive for Mathematical Logic 37 (5-6):343-362.
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.

Analytics

Added to PP
2014-01-16

Downloads
20 (#747,345)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Reverse mathematics and initial intervals.Emanuele Frittaion & Alberto Marcone - 2014 - Annals of Pure and Applied Logic 165 (3):858-879.

Add more citations

References found in this work

Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.
The Galvin-Prikry theorem and set existen axioms.Kazuyuki Tanaka - 1989 - Annals of Pure and Applied Logic 42 (1):81-104.

View all 8 references / Add more references