A computable [image] structure whose theory computes true arithmetic

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

Abstract

We construct a computable $\aleph _{0}\text{-categorical}$ structure whose first order theory is computably equivalent to the true first order theory of arithmetic

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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 computable ℵ 0 -categorical structure whose theory computes true arithmetic.Bakhadyr Khoussainov & Antonio Montalbán - 2010 - Journal of Symbolic Logic 75 (2):728-740.
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.
Applications of Kolmogorov Complexity to Computable Model Theory.B. Khoussainov, P. Semukhin & F. Stephan - 2007 - Journal of Symbolic Logic 72 (3):1041 - 1054.
Interpreting true arithmetic in the [image] degrees.Thomas F. Kent - 2010 - Journal of Symbolic Logic 75 (2):522 - 550.
Prime models of finite computable dimension.Pavel Semukhin - 2009 - Journal of Symbolic Logic 74 (1):336-348.
Interpreting true arithmetic in the local structure of the enumeration degrees.Hristo Ganchev & Mariya Soskova - 2012 - Journal of Symbolic Logic 77 (4):1184-1194.
Equivalence of F with a sub-theory of peano arithmetic.Andrew Boucher - manuscript
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Coding true arithmetic in the Medvedev and Muchnik degrees.Paul Shafer - 2011 - Journal of Symbolic Logic 76 (1):267 - 288.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
Intrinsic bounds on complexity and definability at limit levels.John Chisholm, Ekaterina B. Fokina, Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Sara Quinn - 2009 - Journal of Symbolic Logic 74 (3):1047-1060.
First-order peano arithmetic.Peter Smith - unknown

Analytics

Added to PP
2013-09-30

Downloads
6 (#1,383,956)

6 months
5 (#526,961)

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

No references found.

Add more references