Iterated elementary embeddings and the model theory of infinitary logic.
MetadataShow full item record
We use iterations of elementary embeddings derived from countably complete ideals on ω1 to provide a uniform proof of some classical results connecting the number of models of cardinality ℵ1 in various infinitary logics to the number of syntactic types over the empty set. We introduce the notion of an analytically presented abstract elementary class (AEC), which allows the formulation and proof of generalizations of these results to refer to Galois types rather than syntactic types. We prove (Theorem 0.4) the equivalence of ℵ0-presented classes and analytically presented classes and, using this, generalize (Theorem 0.5) Keisler’s theorem on few models in ℵ1 to bound the number of Galois types rather than the number of syntactic types. Theorem 0.6 gives a new proof (cf. ) for analytically presented AEC’s of the absoluteness of ℵ1-categoricity from amalgamation in ℵ0 and almost Galois ω-stability
SubjectAbstract elementary classes
Iterated elementary embeddings