Journal of Symbolic Logic

A theorem on partial conservativity in arithmetic

Per Lindström

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

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 <. 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.

Article information

Source
J. Symbolic Logic, Volume 76, Issue 1 (2011), 341-347.

Dates
First available in Project Euclid: 4 January 2011

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1294171003

Digital Object Identifier
doi:10.2178/jsl/1294171003

Mathematical Reviews number (MathSciNet)
MR2791351

Zentralblatt MATH identifier
1218.03033

Subjects
Primary: 03F40: Gödel numberings and issues of incompleteness

Citation

Lindström, Per. A theorem on partial conservativity in arithmetic. J. Symbolic Logic 76 (2011), no. 1, 341--347. doi:10.2178/jsl/1294171003. https://projecteuclid.org/euclid.jsl/1294171003


Export citation