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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
84 (#205,729)

6 months
15 (#185,276)

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