Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T07:19:13.312Z Has data issue: false hasContentIssue false
  • English
  • Français

Two theorems on degrees of models of true arithmetic

Published online by Cambridge University Press:  12 March 2014

Julia Knight ,
Alistair H. Lachlan  and
Robert I. Soare
Julia Knight
Affiliation:
University of Notre Dame, Notre Dame, Indiana 46556
Alistair H. Lachlan
Affiliation:
Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6
Robert I. Soare
Affiliation:
University of Chicago, Chicago, Illinois 60637
Get access Rights & Permissions [Opens in a new window]

Extract

Let PA be the theory of first order Peano arithmetic, in the language L with binary operation symbols + and ·. Let N be the theory of the standard model of PA. We consider countable models M of PA such that the universe ∣M∣ is ω. The degree of such a model M, denoted by deg(M), is the (Turing) degree of the atomic diagram of M. The results of this paper concern the degrees of models of N, but here in the Introduction, we shall give a brief survey of results about degrees of models of PA.

Let D0 denote the set of degrees d such that there is a nonstandard model of M of PA with deg(M) = d. Here are some of the more easily stated results about D0.

(1) There is no recursive nonstandard model of PA; i.e., 0 ∈ D0.

This is a result of Tennenbaum [T].

(2) There existsd ∈ D0such thatd ≤ 0′.

This follows from the standard Henkin argument.

(3) There existsd ∈ D0such thatd < 0′.

Shoenfield [Sh1] proved this, using the Kreisel-Shoenfield basis theorem.

(4) There existsd ∈ D0such thatd′ = 0′.

Jockusch and Soare [JS] improved the Kreisel-Shoenfield basis theorem and obtained (4).

(5) D0 = Dc = De, where Dc denotes the set of degrees of completions of PA and De the set of degrees d such that d separates a pair of effectively inseparable r.e. sets.

Solovay noted (5) in a letter to Soare in which in answer to a question posed in [JS] he showed that Dc is upward closed.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 49 , Issue 2 , June 1984 , pp. 425 - 436
Copyright
Copyright © Association for Symbolic Logic 1984

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

REFERENCES

[EP]Enderton, H. B. and Putnam, H., A note on the hyperarithmetic hierarchy, this Journal, vol. 35 (1970), pp. 429–430.Google Scholar
[Ep]Epstein, R. L., Degrees of unsolvability: structure and theory, Lecture Notes in Mathematics, vol. 759, Springer-Verlag, Berlin, 1979.CrossRefGoogle Scholar
[F]Feferman, S., Arithmetically definable models of formalized arithmetic, Notices of the American Mathematical Society, vol. 5 (1958), p. 679.Google Scholar
[H]Harrington, L., Building nonstandard models of Peano arithmetic, handwritten notes, 1979.Google Scholar
[J1]Jockusch, C. G. Jr., Uniformly introreducible sets, this Journal, vol. 33 (1968), pp. 521–536.Google Scholar
[J2]Jockusch, C. G. Jr., Degrees in which the recursive sets are uniformly recursive, Canadian Journal of Mathematics, vol. 24 (1972), pp. 1092–1099.CrossRefGoogle Scholar
[JSi]Jockusch, C. G. Jr., and Simpson, S. G., A degree theoretic definition of the ramified analytical hierarchy, Annals of Mathematical Logic, vol. 10 (1975), pp. 1–32.CrossRefGoogle Scholar
[JSo]Jockusch, C. G. Jr., and Soare, R. I., classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.Google Scholar
[KN]Knight, J. and Nadel, M., Models of arithematic and closed ideals, this Journal, vol 47 (1982), pp. 833–840.Google Scholar
[M]Marker, D., Degrees of models of true arithmetic, Proceedings of the Her brand Symposium (Logic Colloquium '81), North-Holland, Amsterdam, 1982, pp. 233–243.CrossRefGoogle Scholar
[Mn]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295–310.CrossRefGoogle Scholar
[R]Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[Sa1]Sacks, G. E., On the degrees less than 0′, Annals of Mathematics, ser. 2, vol. 77 (1963), pp. 211–231.CrossRefGoogle Scholar
[Sa2]Sacks, G. E., Forcing with perfect closed sets, Axiomatic set theory, Proceedings of Symposia in Pure Mathematics, vol. 13, part 1, American Mathematical Society, Providence, R. I., 1971, pp. 331–355.CrossRefGoogle Scholar
[Sc]Scott, D., Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory, Proceedings of Symposia in Pure Mathematics, vol. 5, American Mathematical Society, Providence, R. I., 1967, pp. 117–121.CrossRefGoogle Scholar
[Sh1]Shoenfield, J., Degrees of models, this Journal, vol. 25 (1960), pp. 233–237.Google Scholar
[Sh2]Shoenfield, J., Degrees of unsolvability, North-Holland, Amsterdam, 1971.Google Scholar
[Si]Simpson, S. G., Degrees of unsolvability: a survey of results, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1978, pp. 631–652.Google Scholar
[T]Tennenbaum, S., Non-archimedean models for arithmetic, Notices of the American Mathematical Society, vol. 6 (1959), p. 270.Google Scholar