S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 , no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 , no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 , no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 , no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 , no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 , no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical Logic, vol. 45 , no. 5, pp. 519–538 [Book Review]

Bulletin of Symbolic Logic 18 (1):131-134 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600000287

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,928

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

Autostability and computable families of constructivizations. Algebra and Logic, vol. 14, no.6.S. S. Goncharov, V. D. Dzgoev, J. B. Remmel & Terrence Millar - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
Computably Categorical Structures and Expansions by Constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
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.
A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
A computably stable structure with no Scott family of finitary formulas.Peter Cholak, Richard A. Shore & Reed Solomon - 2006 - Archive for Mathematical Logic 45 (5):519-538.
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.
Categoricity of computable infinitary theories.W. Calvert, S. S. Goncharov, J. F. Knight & Jessica Millar - 2009 - Archive for Mathematical Logic 48 (1):25-38.
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.
Linear orders with distinguished function symbol.Douglas Cenzer, Barbara F. Csima & Bakhadyr Khoussainov - 2009 - Archive for Mathematical Logic 48 (1):63-76.
Handbook of Recursive Mathematics, Volume 2, Recursive Algebra, Analysis and Combinatorics.John N. Crossley - 2001 - Bulletin of Symbolic Logic 7 (1):69-71.
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.
Effective categoricity of equivalence structures.Wesley Calvert, Douglas Cenzer, Valentina Harizanov & Andrei Morozov - 2006 - Annals of Pure and Applied Logic 141 (1):61-78.
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,.

Analytics

Added to PP
2019-04-26

Downloads
95 (#181,388)

6 months
1 (#1,471,551)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references