Models of Arithmetic and Subuniform Bounds for the Arithmetic Sets

&
Journal of Symbolic Logic 63 (1):59-72 (1998)
  Copy   BIBTEX

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

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Review: David Marker, J. Stern, Degrees of Models of True Arithmetic; Julia Knight, Alistair H. Lachlan, Robert I. Soare, Two Theorems on Degrees of Models of True Arithmetic. [REVIEW]Terrence S. Millar - 1987 - Journal of Symbolic Logic 52 (2):562-563.
Interpreting true arithmetic in the [image] degrees.Thomas F. Kent - 2010 - Journal of Symbolic Logic 75 (2):522 - 550.
The minimal e-degree problem in fragments of Peano arithmetic.M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang - 2005 - Annals of Pure and Applied Logic 131 (1-3):159-175.
David Marker. Degrees of models of true arithmetic. Proceedings of the Herbrand Symposium, Logic Colloquium '81, Proceedings of the Herbrand Symposium held in Marseilles, France, July 1981, edited by J. Stern, Studies in logic and the foundations of mathematics, vol. 107, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1982, pp. 233–242. - Julia Knight, Alistair H. Lachlan, and Robert I. Soare. Two theorems on degrees of models of true arithmetic. The journal of symbolic logic, vol. 49 , pp. 425–436. [REVIEW]Terrence S. Millar - 1987 - Journal of Symbolic Logic 52 (2):562-563.
The Structural Complexity of Models of Arithmetic.Antonio Montalbán & Dino Rossegger - forthcoming - Journal of Symbolic Logic:1-17.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Model Theory and Non-Standard Arithmetic.A. Robinson - 1970 - Journal of Symbolic Logic 35 (1):149-149.
Interpreting true arithmetic in the local structure of the enumeration degrees.Hristo Ganchev & Mariya Soskova - 2012 - Journal of Symbolic Logic 77 (4):1184-1194.
Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely.Henryk Kotlarski & Bożena Piekart - 2000 - Mathematical Logic Quarterly 46 (1):111-120.

Analytics

Added to PP
2009-01-28

Downloads
36 (#433,254)

6 months
15 (#233,221)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Add more references