A computable ℵ 0 -categorical structure whose theory computes true arithmetic

&
Journal of Symbolic Logic 75 (2):728-740 (2010)
  Copy   BIBTEX

Abstract

We construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1268917501

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

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

A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
The computable dimension of trees of infinite height.Russell Miller - 2005 - Journal of Symbolic Logic 70 (1):111-141.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
The Absolute Arithmetic and Geometric Continua.Philip Ehrlich - 1986 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1986:237 - 246.
Weak theories of nonstandard arithmetic and analysis.Jeremy Avigad - manuscript
⊃E is Admissible in “true” relevant arithmetic.Robert K. Meyer - 1998 - Journal of Philosophical Logic 27 (4):327 - 351.
First-order peano arithmetic.Peter Smith - unknown
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.

Analytics

Added to PP
2010-09-12

Downloads
35 (#469,136)

6 months
9 (#352,597)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Recursively presentable prime models.Leo Harrington - 1974 - Journal of Symbolic Logic 39 (2):305-309.
Theories with recursive models.Manuel Lerman & James H. Schmerl - 1979 - Journal of Symbolic Logic 44 (1):59-76.
Foundations of recursive model theory.Terrence S. Millar - 1978 - Annals of Mathematical Logic 13 (1):45.
Vaught's theorem recursively revisited.Terrence Millar - 1981 - Journal of Symbolic Logic 46 (2):397-411.

Add more references