2003
DOI: 10.2178/jsl/1052669064
|View full text |Cite
|
Sign up to set email alerts
|

Classification theory and 0#

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…L that are isomorphic to T in some cardinal preserving extension of L. The following was proved in [4]:…”
Section: Theorem 1 Let T Be a Countable First Order Theory And Let κmentioning
confidence: 98%
See 1 more Smart Citation
“…L that are isomorphic to T in some cardinal preserving extension of L. The following was proved in [4]:…”
Section: Theorem 1 Let T Be a Countable First Order Theory And Let κmentioning
confidence: 98%
“…But one may consider weakening the requirement that the extension must be generic. Such notions are studied in [4], and it is shown there that this kind of notions are not always decidable. By a cardinal preserving extension of L we mean a transitive model of ZFC that contains all ordinals, is contained in a set-generic extension of V , and has the same cardinals as L. For a tree T ∈ L on (ω 1 )…”
Section: Theorem 1 Let T Be a Countable First Order Theory And Let κmentioning
confidence: 99%