Abstract
We characterize the classifiability of a countable first-order theory T in terms of the solvability (in the sense of [Friedman00]) of the potential-isomorphism problem for models of T.
Citation
Sy D. Friedman. Tapani Hyttinen. Mika Rautila. "Classification theory and 0#." J. Symbolic Logic 68 (2) 580 - 588, June 2003. https://doi.org/10.2178/jsl/1052669064
Information
