Translator Disclaimer
June 2010 A computable ℵ0-categorical structure whose theory computes true arithmetic
Bakhadyr Khoussainov, Antonio Montalbán
J. Symbolic Logic 75(2): 728-740 (June 2010). DOI: 10.2178/jsl/1268917501

Abstract

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

Citation

Download 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

JOURNAL ARTICLE
13 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.75 • No. 2 • June 2010
Back to Top