No CrossRef data available.
Article contents
S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), 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 (1999), 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 (2006), no. 5, pp. 519–538. - Chris Ash, Julia Knight, Mark Manasse and Theodore Slaman. Generic copies of countable structures. Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205. - John Chisholm. Effective model theory vs. recursive model theory. The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1168–1191.
Published online by Cambridge University Press: 15 January 2014
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Reviews
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2012