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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

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

Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
A computable [image] structure whose theory computes true arithmetic.Bakhadyr Khoussainov & Antonio Montalbán - 2010 - Journal of Symbolic Logic 75 (2):728 - 740.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis Hirschfeldt, Bakhadyr Khoussainov & Richard Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
The theory of ceers computes true arithmetic.Uri Andrews, Noah Schweber & Andrea Sorbi - 2020 - Annals of Pure and Applied Logic 171 (8):102811.
Applications of Kolmogorov Complexity to Computable Model Theory.B. Khoussainov, P. Semukhin & F. Stephan - 2007 - Journal of Symbolic Logic 72 (3):1041 - 1054.
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Pavel Semukhin - 2006 - Notre Dame Journal of Formal Logic 47 (1):63-71.
Interpreting true arithmetic in the local structure of the enumeration degrees.Hristo Ganchev & Mariya Soskova - 2012 - Journal of Symbolic Logic 77 (4):1184-1194.

Analytics

Added to PP
2010-09-12

Downloads
52 (#419,495)

6 months
9 (#492,507)

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