Classification theory and 0

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.

Saved in:
Bibliographic Details
Published in:The Journal of symbolic logic 2003-06, Vol.68 (2), p.580-588
Main Authors: Friedman, Sy D., Hyttinen, Tapani, Rautila, Mika
Format: Article
Language:English
Subjects:
Automorphisms
Classification theory
First order theories
Logical theorems
Mathematical functions
Mathematical logic
Mathematical theorems
Model theory
Solvability
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0022-4812
1943-5886
DOI:10.2178/jsl/1052669064