A theorem on partial conservativity in arithmetic

Journal of Symbolic Logic 76 (1):341 - 347 (2011)
  Copy   BIBTEX

Abstract

Improving on a result of Arana, we construct an effective family (φ r | r ∈ ℚ ⋂ [0, 1]) of Σ n -conservative Π n sentences, increasing in strength as r decreases, with the property that ¬φ p is Π n -conservative over PA + φ q whenever p < q. We also construct a family of Σ n sentences with properties as above except that the roles of Σ n and Π n are reversed. The latter result allows to re-obtain an unpublished result of Solovay, the presence of a subset order-isomorphic to the reals in every non-trivial end-segment of every branch of the E-tree, and to generalize it to analogues of the E-tree at higher levels of the arithmetical hierarchy

Links

PhilArchive



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

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

Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
A note on Goodman's theorem.Ulrich Kohlenbach - 1999 - Studia Logica 63 (1):1-5.
Frege's unofficial arithmetic.Agustín Rayo - 2002 - Journal of Symbolic Logic 67 (4):1623-1638.
Deciding arithmetic using SAD computers.Mark Hogarth - 2004 - British Journal for the Philosophy of Science 55 (4):681-691.

Analytics

Added to PP
2013-09-30

Downloads
20 (#716,889)

6 months
1 (#1,428,112)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Duality, non-standard elements, and dynamic properties of r.e. sets.V. Yu Shavrukov - 2016 - Annals of Pure and Applied Logic 167 (10):939-981.

Add more citations

References found in this work

No references found.

Add more references