Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-25T19:30:50.664Z Has data issue: false hasContentIssue false
  • English
  • Français

Some theorems on extensions of arithmetic1

Published online by Cambridge University Press:  12 March 2014

Robert A. Di Paola
Robert A. Di Paola*
Affiliation:
University of California, Los Angeles
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 32 , Issue 2 , August 1967 , pp. 180 - 189
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.)

References

[1]Davis, M., Computability and unsohability, McGraw Hill, New York, 1958.Google Scholar
[2]Davis, M., Pseudo-complements of recursively enumerable sets, Preliminary Report, Bulletin of the American Mathematical Society, vol. 60 (1954), pp. 169–170.Google Scholar
[3]Di Paola, R. A., Some properties of pseudo-complements of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 121 (1966), pp. 296–308.CrossRefGoogle Scholar
[4]Di Paola, R. A., Pseudo-complements and ordinal logics based on consistency statements, this Journal, Vol. 31 (1966), pp. 359–364.Google Scholar
[5]Feferman, S., Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 35–92.CrossRefGoogle Scholar
[6]Feferman, S., Transfinite recursive progressions of axiomatic theories, this Journal, vol. 27 (1962), pp. 259–316.Google Scholar
[7]Feferman, S. and Spector, C., Incompleteness along paths in progressions of theories, this Journal, vol. 27 (1962), pp. 383–390.Google Scholar
[8]Tarski, A., Mostowski, A., and Robinson, R., Undecidabte theories. Studies in logic and the foundations of mathematics, North Holland, Amsterdam, 1953.Google Scholar
[9]Turing, A. M., Systems of logic based on ordinals, Proceedings of the London Mathematical Society, vol. 45 (1939), pp. 161–228.CrossRefGoogle Scholar