HOME

TheInfoList



OR:

In
model theory In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing statements about a mathematical structure), and their models (those structures in which the ...
, a discipline within
mathematical logic Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal ...
, 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 In model theory, a branch of mathematical logic, two structures ''M'' and ''N'' of the same signature ''σ'' are called elementarily equivalent if they satisfy the same first-order ''σ''-sentences. If ''N'' is a substructure of ''M'', one ofte ...
of an
elementary class In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory. Definition A class ''K'' of structures of a signature σ is called an ...
in first-order model theory. They were introduced by
Saharon Shelah Saharon Shelah ( he, שהרן שלח; born July 3, 1945) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey. Biography Shelah was born in Jerusalem on July ...
.


Definition

\langle K, \prec_K\rangle, for K a class of structures in some language L = L(K), is an AEC if it has the following properties: * \prec_K is a
partial order In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary ...
on K. * If M\prec_K N then M is a substructure of N. * Isomorphisms: K is closed under
isomorphism In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word i ...
s, and if M,N,M',N'\in K, f\colon M\simeq M', g\colon N\simeq N', f\subseteq g, and M\prec_K N, then M'\prec_K N'. * Coherence: If M_1\prec_K M_3, M_2\prec_K M_3, and M_1\subseteq M_2, then M_1\prec_K M_2. * Tarski–Vaught
chain A chain is a wikt:series#Noun, serial assembly of connected pieces, called links, typically made of metal, with an overall character similar to that of a rope in that it is flexible and curved in compression (physics), compression but line (g ...
axioms: If \gamma is an ordinal and \\subseteq K is a chain (i.e. \alpha<\beta<\gamma\implies M_\alpha\prec_K M_\beta), then: ** \bigcup_ M_\alpha\in K ** If M_\alpha\prec_K N, for all \alpha<\gamma, then \bigcup_ M_\alpha\prec_K N * Löwenheim–Skolem axiom: There exists a
cardinal Cardinal or The Cardinal may refer to: Animals * Cardinal (bird) or Cardinalidae, a family of North and South American birds **'' Cardinalis'', genus of cardinal in the family Cardinalidae **'' Cardinalis cardinalis'', or northern cardinal, ...
\mu \ge , L(K), + \aleph_0, such that if A is a subset of the universe of M, then there is N in K whose universe contains A such that \, N\, \leq , A, +\mu and N\prec_K M. We let \operatorname(K) denote the least such \mu and call it the Löwenheim–Skolem number of K. 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 (we will adopt this convention in this article). 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 K-embedding is a map f: M \rightarrow N for M, N \in K such that f \prec_K N and f is an isomorphism from M onto f /math>. If K is clear from context, we omit it.


Examples

The following are examples of abstract elementary classes: * An
Elementary class In model theory, a branch of mathematical logic, an elementary class (or axiomatizable class) is a class consisting of all structures satisfying a fixed first-order theory. Definition A class ''K'' of structures of a signature σ is called an ...
is the most basic example of an AEC: If ''T'' is a first-order theory, then the class \operatorname(T) of models of ''T'' together with
elementary substructure In model theory, a branch of mathematical logic, two structures ''M'' and ''N'' of the same signature ''σ'' are called elementarily equivalent if they satisfy the same first-order ''σ''-sentences. If ''N'' is a substructure of ''M'', one ofte ...
forms an AEC with Löwenheim–Skolem number '', T, ''. * If \phi is a sentence in the
infinitary logic An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. Some infinitary logics may have different properties from those of standard first-order logic. In particular, infinitary logics may fail to be com ...
L_, and \mathcal is a countable fragment containing \phi, then \langle \operatorname(T), \prec_ \rangle is an AEC with Löwenheim–Skolem number \aleph_0. This can be generalized to other logics, like L_, or L_(Q), where Q expresses "there exists uncountably many". * If ''T'' is a first-order countable
superstable In the mathematical field of model theory, a complete theory is called stable if it does not have too many types. One goal of classification theory is to divide all complete theories into those whose models can be classified and those whose model ...
theory, the set of \aleph_1-saturated models of ''T'', together with elementary substructure, is an AEC with Löwenheim–Skolem number 2^. * Zilber's pseudo-exponential fields form an AEC.


Common assumptions

AECs are very general objects and one usually make some of the assumptions below when studying them: * An AEC has ''joint embedding'' if any two model can be embedded inside a common model. * An AEC has ''no maximal model'' if any model has a proper extension. * An AEC K has ''amalgamation'' if for any triple M_0, M_1, M_2 \in K with M_0 \prec_K M_1, M_0 \prec_K M_2, there is N \in K and embeddings of M_1 and M_2 inside N that fix M_0 pointwise. Note that in elementary classes, joint embedding holds whenever the theory is
complete Complete may refer to: Logic * Completeness (logic) * Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable Mathematics * The completeness of the real numbers, which implies ...
, while amalgamation and no maximal models are well-known consequences of the
compactness theorem In mathematical logic, the compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of it has a model. This theorem is an important tool in model theory, as it provides a useful (but generally ...
. These three assumptions allow us to build a universal model-homogeneous monster model \mathfrak, exactly as in the elementary case. Another assumption that one can make is
tameness A tame animal is an animal that is relatively tolerant of human presence. Tameness may arise naturally (as in the case, for example, of island tameness) or due to the deliberate, human-directed process of training an animal against its initially ...
.


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 In mathematical logic, a theory is categorical if it has exactly one model (up to isomorphism). Such a theory can be viewed as ''defining'' its model, uniquely characterizing the model's structure. In first-order logic, only theories with a fin ...
, 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 \mu depending only on \operatorname(K) such that if ''K'' is categorical in ''some'' \lambda \geq \mu (i.e. ''K'' has exactly one (up to isomorphism) model of size \lambda), then ''K'' is categorical in \theta for ''all'' \theta \ge \mu. Shelah also has several stronger conjectures: The threshold cardinal for categoricity is the Hanf number of pseudoelementary classes in a language of cardinality LS(K). More specifically when the class is in a countable language and axiomaziable by an L_ sentence the threshold number for categoricity is \beth_. This conjecture dates back to 1976. Several approximations have been published (see for example the results section below), assuming
set-theoretic Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concer ...
assumptions (such as the existence of
large cardinals In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very "large" (for example, bigger than the least � ...
or variations of the
generalized continuum hypothesis In mathematics, the continuum hypothesis (abbreviated CH) is a hypothesis about the possible sizes of infinite sets. It states that or equivalently, that In Zermelo–Fraenkel set theory with the axiom of choice (ZFC), this is equivalent t ...
), or model-theoretic assumptions (such as amalgamation or tameness). 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. * Shelah's Presentation Theorem: Any AEC K is \operatorname_: it is a reduct of a class of models of a first-order theory omitting at most 2^
types Type may refer to: Science and technology Computing * Typing, producing text via a keyboard, typewriter, etc. * Data type, collection of values used for computations. * File type * TYPE (DOS command), a command to display contents of a file. * Ty ...
. * Hanf number for existence: Any AEC K which has a model of size \beth_ has models of arbitrarily large sizes. * Amalgamation from categoricity: If ''K'' is an AEC categorical in \lambda and \lambda^+ and 2^\lambda < 2^, then ''K'' has amalgamation for models of size \lambda. * Existence from categoricity: If ''K'' is a \operatorname_ AEC with Löwenheim–Skolem number \aleph_0 and ''K'' is categorical in \aleph_0 and \aleph_1, then ''K'' has a model of size \aleph_2. In particular, no sentence of L_(Q) can have exactly one uncountable model. * Approximations to Shelah's categoricity conjecture: **Downward transfer from a successor: If ''K'' is an abstract elementary class with amalgamation that is categorical in a "high-enough"
successor Successor may refer to: * An entity that comes after another (see Succession (disambiguation)) Film and TV * ''The Successor'' (film), a 1996 film including Laura Girling * ''The Successor'' (TV program), a 2007 Israeli television program Mus ...
\lambda, then ''K'' is categorical in all high-enough \mu \le \lambda. ** Shelah's categoricity conjecture for a successor from large cardinals:This is due to Will Boney, but combines results of many people, including Grossberg, Makkai, Shelah, and VanDieren. A proof appears in , Theorem 7.5. If there are class-many
strongly compact cardinal In set theory, a branch of mathematics, a strongly compact cardinal is a certain kind of large cardinal. A cardinal κ is strongly compact if and only if every κ-complete filter can be extended to a κ-complete ultrafilter. Strongly compact card ...
s, then Shelah's categoricity conjecture holds when we start with categoricity at a successor.


See also

*
Tame abstract elementary class In model theory, a discipline within the field of mathematical logic, a tame abstract elementary class is an abstract elementary class (AEC) which satisfies a locality property for types called tameness. Even though it appears implicitly in earlier ...


Notes


References

* * * * * * * *{{Cite arXiv , last1=Boney , first1=Will , title=Tameness from large cardinal axioms , eprint=1303.0550v4 , year=2014 , class=math.LO Model theory Category theory