No CrossRef data available.
Article contents
Classification theory and 0#
Published online by Cambridge University Press: 12 March 2014
Abstract
We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [2]) of the potential-isomorphism problem for models of T.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2003
References
REFERENCES
[1]Baldwin, J. T., Laskowski, M. C.. and Shelah, S., Forcing isomorphism, this Journal, vol. 58 (1993). no. 4, pp. 1291–1301.Google Scholar
[3]Huuskonen, T., Hyttinen, T., and Rautila, M., On potential isomorphism and non-structure. Archive for Mathematical Logic, to appear.Google Scholar
[4]Hyttinen, T. and Tuuri, H., Constructing strongly equivalent nonisomorphic models for unstable theories, Annal of Pure and Applied Logic, vol. 52 (1991), no. 3, pp. 203–248.CrossRefGoogle Scholar
[5]Laskowski, M. C. and Shelah, S., Forcing isomorphism. II, this Journal, vol. 61 (1996), no. 4, pp. 1305–1320.Google Scholar
[6]Nadel, M. and Stavi, J., L ∞,λ-equivalence, isomorphism and potential isomorphism. Transactions of the American Mathematical Society, vol. 236 (1978), pp. 51–74.Google Scholar
[7]Shelah, S., The number of non-isomorphic models of an unstable first-order theory, Israel journal of Mathematics, vol. 9 (1971), pp. 473–487.CrossRefGoogle Scholar
[8]Shelah, S., Existence of many L ∞, λ-equivalent, nonisomorphic models of T of power λ. Annals of Pure and Applied Logic, vol. 34 (1987), no. 3, pp. 291–310.CrossRefGoogle Scholar
[9]Shelah, S., Tuuri, H., and Väänänen, J., On the number of automorphisms of uncountable models, this Journal, vol. 58 (1993), no. 4, pp. 1402–1418.Google Scholar