Tame abstract elementary class

Last updated

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, [1] who observed that tame AECs were much easier to handle than general AECs.

Contents

Definition

Let K be an AEC with joint embedding, amalgamation, and no maximal models. Just like in first-order model theory, this implies K has a universal model-homogeneous monster model . Working inside , we can define a semantic notion of types by specifying that two elements a and b have the same type over some base model if there is an automorphism of the monster model sending a to b fixing pointwise (note that types can be defined in a similar manner without using a monster model [2] ). Such types are called Galois types.

One can ask for such types to be determined by their restriction on a small domain. This gives rise to the notion of tameness:

Tame AECs are usually also assumed to satisfy amalgamation.

Discussion and motivation

While (without the existence of large cardinals) there are examples of non-tame AECs, [3] most of the known natural examples are tame. [4] In addition, the following sufficient conditions for a class to be tame are known:

Many results in the model theory of (general) AECs assume weak forms of the Generalized continuum hypothesis and rely on sophisticated combinatorial set-theoretic arguments. [8] On the other hand, the model theory of tame AECs is much easier to develop, as evidenced by the results presented below.

Results

The following are some important results about tame AECs.

Notes

  1. Grossberg & VanDieren 2006a.
  2. Shelah 2009, Definition II.1.9.
  3. Baldwin & Shelah 2008.
  4. See the discussion in the introduction of Grossberg & VanDieren 2006a.
  5. Boney 2014, Theorem 1.3.
  6. Shelah 1999, Main claim 2.3 (9.2 in the online version).
  7. Grossberg & VanDieren 2006b.
  8. See for example many of the hard theorems of Shelah's book (Shelah 2009).
  9. Grossberg & VanDieren 2006b.
  10. See Baldwin, Kueker & VanDieren 2006, Theorem 4.5 for the first result and Grossberg & VanDieren 2006a for the second.
  11. Lieberman 2011, Proposition 4.1.
  12. See Vasey 2014 for the first result, and Boney & Vasey 2014, Corollary 6.10.5 for the result on dimension.

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, model theory is the study of the relationship between formal theories, and their models, taken as interpretations that satisfy the sentences of that theory.

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

In set theory, a supercompact cardinal is a type of large cardinal. They display a variety of reflection properties.

In mathematics, a remarkable cardinal is a certain kind of large cardinal number.

In mathematics, particularly in mathematical logic and set theory, a club set is a subset of a limit ordinal that is closed under the order topology, and is unbounded relative to the limit ordinal. The name club is a contraction of "closed and unbounded".

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.

In set theory, a branch of mathematics, a Reinhardt cardinal is a kind of large cardinal. Reinhardt cardinals are considered under ZF, because they are inconsistent with ZFC. They were suggested by American mathematician William Nelson Reinhardt (1939–1998).

In set theory, Easton's theorem is a result on the possible cardinal numbers of powersets. Easton (1970) showed via forcing that the only constraints on permissible values for 2κ when κ is a regular cardinal are

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.

The notion of cylindric algebra, invented by Alfred Tarski, arises naturally in the algebraization of first-order logic with equality. This is comparable to the role Boolean algebras play for propositional logic. Indeed, cylindric algebras are Boolean algebras equipped with additional cylindrification operations that model quantification and equality. They differ from polyadic algebras in that the latter do not model equality.

In model theory, a branch of mathematical logic, a complete first-order theory T is called stable in λ, if the Stone space of every model of T of size ≤ λ has itself size ≤ λ. T is called a stable theory if there is no upper bound for the cardinals κ such that T is stable in κ. The stability spectrum of T is the class of all cardinals κ such that T is stable in κ.

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 models are too complicated to classify, and to classify all models in the cases where this can be done. Roughly speaking, if a theory is not stable then its models are too complicated and numerous to classify, while if a theory is stable there might be some hope of classifying its models, especially if the theory is superstable or totally transcendental.

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.

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.

This is a glossary of set theory.

Monica M. VanDieren is an American mathematician specializing in mathematical logic and model theory. She is University Professor of Mathematics and Director of the University Honors Program at Robert Morris University.

References