Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T15:32:13.387Z Has data issue: false hasContentIssue false

On the complexity of models of arithmetic

Published online by Cambridge University Press:  12 March 2014

Kenneth McAloon*
Affiliation:
U.E.R. de Mathematiques, Universite Paris VII, Paris, France
*
Current address: Brooklyn College of C.U.N.Y., Brooklyn, New York, 11210

Abstract

Let P0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M′ of M which is a model of T such that the complete diagram of M′ is Turing reducible to the atomic diagram of M. Moreover, neither the addition nor the multiplication of M is recursive.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1982

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