Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-28T16:29:11.841Z Has data issue: false hasContentIssue false
  • English
  • Français

Models of arithmetic and subuniform bounds for the arithmetic sets

Published online by Cambridge University Press:  12 March 2014

Alistair H. Lachlan  and
Robert I. Soare
Alistair H. Lachlan
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6, E-mail: [email protected]
Robert I. Soare
Affiliation:
Department of Mathematics, University of Chicago, Chicago, Illinois 60637-1546, USA, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

It has been known for more than thirty years that the degree of a non-standard model of true arithmetic is a subuniform upper bound for the arithmetic sets (suub). Here a notion of generic enumeration is presented with the property that the degree of such an enumeration is an suub but not the degree of a non-standard model of true arithmetic. This answers a question posed in the literature.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 63 , Issue 1 , March 1998 , pp. 59 - 72
Copyright
Copyright © Association for Symbolic Logic 1998

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

[1]Friedberg, R. M., A criterion for completeness of degrees of unsolvability, this Journal, vol. 22 (1957), pp. 159–160.Google Scholar
[2]Knight, J., Lachlan, A. H., and Soare, R. I., Two theorems on degrees of models of arithmetic, this Journal, vol. 49 (1984), pp. 425–436.Google Scholar
[3]Knight, J. F., Additive structure in uncountable models for a fixed completion of p, this Journal, vol. 55 (1983), pp. 623–628.Google Scholar
[4]Knight, J. F., Degrees of models with prescribed Scott set, Proceedings of the U.S.-Israel workshop on model theory in mathematical logic: Classification theory, Chicago, December 15–19, 1985 (Baldwin, John, editor), Lecture Notes in Mathematics, no. 1292, Springer-Verlag, Berlin, Heidelberg, New York, 1987, pp. 182–191.Google Scholar
[5]Knight, J. F., A metatheorem for constructions by finitely many workers, this Journal, vol. 55 (1990), pp. 787–804.Google Scholar
[6]Lachlan, A. H. and Soare, R. I., Models of arithmetic and upper bounds for arithmetic sets, this Journal, vol. 59 (1994), pp. 977–983.Google Scholar
[7]Lerman, M., Upper bounds for the arithmetical degrees, Annals of Pure and Applied Logic, vol. 29 (1985), pp. 225–253.CrossRefGoogle Scholar
[8]Macintyre, A. and Marker, D., Degrees of recursively saturated models, Transactions of the American Mathematical Society, vol. 282 (1984), pp. 539–554.CrossRefGoogle Scholar
[9]Marker, D., Degrees of models of true arithmetic, Proceedings of the Herbrand symposium: Logic colloquium (Stern, J., editor), North-Holland, Amsterdam, 1981, pp. 233–242.Google Scholar
[10]Scott, D., Algebras of sets binumerable in complete extensions of arithmetic, Recursive function theory: Proceedings ofsympos. in pure mathematics, vol. 5, American Mathematical Society, Providence, 1961, pp. 117–121.CrossRefGoogle Scholar
[11]Solovay, R. M., Degrees of models of true arithmetic, preliminary version, unpublished manuscript, 1984.Google Scholar