What does it mean to realize a type?

A type lists conditions an element should satisfy. An element of a structure realizes the type if it satisfies all those conditions simultaneously; if no element does, the type is omitted. Saturated models realize as many types as their cardinality permits.

Why are saturated models useful?

Because they realize all small types, they contain a copy of every small configuration consistent with the theory, so working inside a single saturated model lets one treat all relevant elements as already present, greatly simplifying arguments about definable sets.

Types and Saturated Models

A type is a consistent collection of formulas describing the possible behavior of an element, and saturated models are rich structures that realize as many types as their size allows.

Definition

A type over a parameter set in a structure is a maximal consistent set of formulas in finitely many variables with those parameters; a model is saturated if it realizes every type over every parameter set of smaller cardinality, making it as homogeneous and universal as possible.

Scope

This topic covers complete and partial types over a set of parameters, the Stone space of types, realizing and omitting types, the omitting types theorem, and the construction and uniqueness of saturated and homogeneous models, together with their role in counting models and in stability theory.

Core questions

What information about a model does the space of types encode?
When can a type that is consistent fail to be realized in a given model?
How are saturated models constructed and why are they unique?
How do types and saturation support the classification of theories?

Key theories

Stone space of types: The complete types over a set form a compact totally disconnected topological space whose points are the types and whose structure governs the definable sets, linking model theory to topology.
Omitting types theorem: A countable theory has a countable model omitting a given nonisolated type, providing a method to build models avoiding prescribed behavior.
Existence and uniqueness of saturated models: Under suitable cardinal arithmetic a theory has a saturated model in a given cardinality, and any two saturated models of the same cardinality that are elementarily equivalent are isomorphic.

Clinical relevance

Types and saturation are central technical tools of modern model theory: saturated models serve as a universal arena, called a monster model, in which definable sets and the geometry of a theory are studied, and the counting of types over sets is the basis of Shelah's stability theory and its applications.

History

Saturated and homogeneous models were developed by Joensson, Vaught, and Morley around 1960, and the omitting types theorem stems from the same period. Counting types over sets became the organizing idea of Shelah's classification theory, which uses saturation to study the number of models a theory has in each cardinality.

Key figures

Michael Morley
Saharon Shelah
Robert Vaught
Bjarni Joensson

Seminal works

marker2002
changkeisler1990
tentziegler2012

Frequently asked questions

What does it mean to realize a type?: A type lists conditions an element should satisfy. An element of a structure realizes the type if it satisfies all those conditions simultaneously; if no element does, the type is omitted. Saturated models realize as many types as their cardinality permits.
Why are saturated models useful?: Because they realize all small types, they contain a copy of every small configuration consistent with the theory, so working inside a single saturated model lets one treat all relevant elements as already present, greatly simplifying arguments about definable sets.