Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T14:59:25.191Z Has data issue: false hasContentIssue false

Models of arithmetic and subuniform bounds for the arithmetic sets

Published online by Cambridge University Press:  12 March 2014

Alistair H. Lachlan
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia, CanadaV5A 1S6, E-mail: alistair@sfu.ca
Robert I. Soare
Affiliation:
Department of Mathematics, University of Chicago, Chicago, Illinois 60637-1546, USA, E-mail: soare@math.uchicago.edu

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.

Information

Type
Research Article
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.)

Article purchase

Temporarily unavailable