Abstract
We construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.
Citation
Bakhadyr Khoussainov. Antonio Montalbán. "A computable ℵ0-categorical structure whose theory computes true arithmetic." J. Symbolic Logic 75 (2) 728 - 740, June 2010. https://doi.org/10.2178/jsl/1268917501
Information
Published: June 2010
First available in Project Euclid: 18 March 2010
zbMATH: 1201.03020
MathSciNet: MR2648162
Digital Object Identifier: 10.2178/jsl/1268917501
Rights: Copyright © 2010 Association for Symbolic Logic
