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 [Book Review]

Bulletin of Symbolic Logic 19 (3):400-401 (2013)
  Copy   BIBTEX


This article has no associated abstract. (fix it)



    Upload a copy of this work     Papers currently archived: 92,923

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

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.
Computable polish group actions.Alexander Melnikov & Antonio Montalbán - 2018 - Journal of Symbolic Logic 83 (2):443-460.
Computable categoricity and the Ershov hierarchy.Bakhadyr Khoussainov, Frank Stephan & Yue Yang - 2008 - Annals of Pure and Applied Logic 156 (1):86-95.


Added to PP

9 (#1,276,707)

6 months
6 (#582,229)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Alexander Melnikov
National Research University Higher School of Economics

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references