Abstract elementary class

Last updated

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. [1]

Contents

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 (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 -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: [2]

Common assumptions

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 (i.e. K has exactly one (up to isomorphism) model of size ), 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(K). 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 (see for example the results section below), assuming set-theoretic assumptions (such as the existence of large cardinals or variations of the generalized continuum hypothesis), 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.

See also

Notes

  1. Shelah 1987.
  2. Grossberg 2002, Section 1.
  3. Grossberg 2002, Theorem 3.4.
  4. Grossberg 2002, Corollary 3.5. Note that there is a typo there and that should be replaced by .
  5. Grossberg 2002, Theorem 4.3.
  6. Grossberg 2002, Theorem 5.1.
  7. Shelah 1999.
  8. This is due to Will Boney, but combines results of many people, including Grossberg, Makkai, Shelah, and VanDieren. A proof appears in Boney 2014, Theorem 7.5.

Related Research Articles

In mathematics, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:

There is no set whose cardinality is strictly between that of the integers and the real numbers.

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

In the mathematical discipline of set theory, forcing is a technique for proving consistency and independence results. It was first used by Paul Cohen in 1963, to prove the independence of the axiom of choice and the continuum hypothesis from Zermelo–Fraenkel set theory.

In set theory, a Woodin cardinal is a cardinal number λ such that for all functions

Aleph number infinite cardinal number

In mathematics, particularly in set theory, the aleph numbers are a sequence of numbers used to represent the cardinality of infinite sets that can be well-ordered. They were introduced by the mathematician Georg Cantor and are named after the symbol he used to denote them, the Hebrew letter aleph.

In mathematical logic, the Löwenheim–Skolem theorem is a theorem on the existence and cardinality of models, named after Leopold Löwenheim and Thoralf Skolem.

In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from another cardinal by repeated successor operations. These cardinals are sometimes called simply "limit cardinals" when the context is clear.

In set theory, a regular cardinal is a cardinal number that is equal to its own cofinality. More explicitly, this means that is a regular cardinal if and only if every unbounded subset has cardinality . Infinite well-ordered cardinals that are not regular are called singular cardinals. Finite cardinal numbers are typically not called regular or singular.

In mathematics, the beth numbers are a certain sequence of infinite cardinal numbers, conventionally written , where is the second Hebrew letter (beth). The beth numbers are related to the aleph numbers, but there may be numbers indexed by that are not indexed by .

PCF theory is the name of a mathematical theory, introduced by Saharon Shelah (1978), that deals with the cofinality of the ultraproducts of ordered sets. It gives strong upper bounds on the cardinalities of power sets of singular cardinals, and has many more applications as well. The abbreviation "PCF" stands for "possible cofinalities".

In mathematics, specifically set theory and model theory, a stationary set is a set that is not too small in the sense that it intersects all club sets, and is analogous to a set of non-zero measure in measure theory. There are at least three closely related notions of stationary set, depending on whether one is looking at subsets of an ordinal, or subsets of something of given cardinality, or a powerset.

In model theory, a branch of mathematical logic, the spectrum of a theory is given by the number of isomorphism classes of models in various cardinalities. More precisely, for any complete theory T in a language we write I(T, α) for the number of models of T of cardinality α. The spectrum problem is to describe the possible behaviors of I(T, α) as a function of α. It has been almost completely solved for the case of a countable theory T.

Rami Grossberg is a full professor of mathematics at Carnegie Mellon University and works in model theory.

In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.

Frederick William Galvin is a mathematician, currently a professor at the University of Kansas. His research interests include set theory and combinatorics.

In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the continuum and combinatorics on successors of singular cardinals.

Menachem Magidor Israeli mathematician

Menachem Magidor is an Israeli mathematician who specializes in mathematical logic, in particular set theory. He served as President of the Hebrew University of Jerusalem, was President of the Association for Symbolic Logic from 1996 to 1998, and is currently the President of the Division for Logic, Methodology and Philosophy of Science and Technology of the International Union for History and Philosophy of Science. In 2016 he was elected an honorary foreign member of the American Academy of Arts and Sciences. In 2018 he received the Solomon Bublick Award.

This is a glossary of set theory.

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 work of Shelah, tameness as a property of AEC was first isolated by Grossberg and VanDieren, who observed that tame AECs were much easier to handle than general AECs.

References