Abstract elementary class


In model theory, a discipline within mathematical logic, an abstract elementary class, or AEC for short, is a class of models with a partial order similar to the relation of an elementary substructure of an elementary class in first-order model theory. They were introduced by Saharon Shelah.

Definition

, for a class of structures in some language, is an AEC if it has the following properties:
Note that we usually do not care about the models of size less than the Löwenheim–Skolem number and often assume that there are none. This is justified since we can always remove all such models from an AEC without influencing its structure above the Löwenheim–Skolem number.
A -embedding is a map for such that and is an isomorphism from onto. If is clear from context, we omit it.

Examples

The following are examples of abstract elementary classes:
AECs are very general objects and one usually make some of the assumptions below when studying them:
Note that in elementary classes, joint embedding holds whenever the theory is complete, while amalgamation and no maximal models are well-known consequences of the compactness theorem. These three assumptions allow us to build a universal model-homogeneous monster model, exactly as in the elementary case.
Another assumption that one can make is tameness.

Shelah's categoricity conjecture

Shelah introduced AECs to provide a uniform framework in which to generalize first-order classification theory. Classification theory started with Morley's categoricity theorem, so it is natural to ask whether a similar result holds in AECs. This is Shelah's eventual categoricity conjecture. It states that there should be a Hanf number for categoricity:
For every AEC K there should be a cardinal depending only on such that if K is categorical in some , then K is categorical in for all.
Shelah also has several stronger conjectures: The threshold cardinal for categoricity is the Hanf number of pseudoelementary classes in a language of cardinality LS. More specifically when the class is in a countable language and axiomaziable by an sentence the threshold number for categoricity is. This conjecture dates back to 1976.
Several approximations have been published, assuming set-theoretic assumptions, or model-theoretic assumptions. As of 2014, the original conjecture remains open.

Results

The following are some important results about AECs. Except for the last, all results are due to Shelah.