Journal of Symbolic Logic

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

Bakhadyr Khoussainov and Antonio Montalbán

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

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

Article information

Source
J. Symbolic Logic, Volume 75, Issue 2 (2010), 728-740.

Dates
First available in Project Euclid: 18 March 2010

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1268917501

Digital Object Identifier
doi:10.2178/jsl/1268917501

Mathematical Reviews number (MathSciNet)
MR2648162

Zentralblatt MATH identifier
1201.03020

Citation

Khoussainov, Bakhadyr; Montalbán, Antonio. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. J. Symbolic Logic 75 (2010), no. 2, 728--740. doi:10.2178/jsl/1268917501. https://projecteuclid.org/euclid.jsl/1268917501


Export citation