Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T20:55:24.152Z Has data issue: false hasContentIssue false

Some theorems on extensions of arithmetic1

Published online by Cambridge University Press:  12 March 2014

Robert A. Di Paola*
Affiliation:
University of California, Los Angeles

Extract

In this paper we study some of the consequences of adding as new axioms to consistent re (recursively enumerable) extensions T of Peano arithmetic P sentences undecidable in T of the Π10 variety, as are those one naturally comes upon. The question arises: how much can two extensions “differ” when each is obtained by adding just once distinct Π10 sentences undecidable in T? We shall show that if T is as stated above, we can find extensions T1 and T2, constructed very simply from T, having the property that if (A, B) is any pair of re sets with recursive intersection, there can be found a Π10 formula of P which represents A in T1 and B in T2.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1967

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable