Classification theory and 0

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Journal of symbolic logic 2003-06, Vol.68 (2), p.580-588
Hauptverfasser: Friedman, Sy D., Hyttinen, Tapani, Rautila, Mika
Format: Artikel
Sprache:eng
Schlagworte:
Automorphisms
Classification theory
First order theories
Logical theorems
Mathematical functions
Mathematical logic
Mathematical theorems
Model theory
Solvability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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