1 Foundations

Model theory studies formal systems by pairing symbolic expressions with mathematical structures that make them true or false. Its central aim is to understand how syntax, such as formulas and proofs, interacts with semantics, such as interpretations in groups, fields, orders, or graphs. This perspective allows logicians to compare theories by the kinds of models they admit and the properties those models share.

1.1 Formal languages

A formal language provides the symbols and rules used to write statements about mathematical objects. In model theory, the language is chosen to match the kind of structures under study, so the same symbols can be interpreted consistently across many examples.

1.1.1 Signatures and vocabularies

A signature, also called a vocabulary, specifies the nonlogical symbols of a language. It lists relation symbols, function symbols, and constant symbols together with their arities. The signature determines what sort of structure a model must supply.

1.1.2 Terms and formulas

Terms are expressions that denote elements of a structure, built from variables, constants, and function symbols. Formulas are statements formed from terms using relation symbols, logical connectives, and quantifiers. Together, they encode properties and relations that can be tested in a model.

1.1.3 Sentences and theories

A sentence is a formula with no free variables, so it can be evaluated outright in a structure. A theory is a set of sentences, usually intended to describe a class of structures. The study of theories focuses on which models satisfy all of their sentences.

1.2 Structures and interpretations

A structure gives meaning to the symbols of a language. It consists of a domain together with interpretations for each relation, function, and constant in the signature.

1.2.1 Domains and relations

The domain is the underlying set of a structure, the collection of objects about which the language speaks. Relation symbols are interpreted as subsets of appropriate Cartesian powers of the domain. These interpretations determine when a relation holds among elements.

1.2.2 Functions and constants

Function symbols are interpreted as actual operations on the domain. Constant symbols name specific elements of the structure. Together, they let the language express algebraic and combinatorial constructions directly.

1.2.3 Satisfaction

Satisfaction is the relation between a structure and a formula, usually written to indicate that the structure makes the formula true under an assignment of values to variables. It is defined inductively by the structure of formulas. Satisfaction is the basic semantic notion that links syntax to meaning.

1.3 Semantic consequence

Semantic consequence describes what follows from a set of sentences in every model that satisfies them. It is a model-theoretic version of logical implication.

1.3.1 Validity and satisfiability

A sentence is valid if it holds in every structure of the given language. A set of sentences is satisfiable if some structure satisfies them all. These notions measure whether a formal statement is universally true or at least realizable.

1.3.2 Logical equivalence

Two formulas are logically equivalent when they have the same truth conditions in every structure. In practice, this means each implies the other semantically. Logical equivalence is useful for replacing complicated expressions with simpler ones without changing meaning.

1.3.3 Elementary consequence

One sentence is an elementary consequence of a theory if every model of the theory satisfies it. This relation captures what can be deduced purely from the semantic content of the theory. It is central to the analysis of axiomatic systems.

2 Core concepts

The core ideas of model theory concern theories, their models, and the maps and notions that compare structures. These concepts help classify mathematical systems according to what first-order logic can express about them.

2.1 Models and theories

A model is a structure that satisfies a given theory. The theory records the formal properties of the models in a language.

2.1.1 Axiomatization

Axiomatization is the process of describing a class of structures by a set of sentences. A good axiomatization captures the intended examples while excluding unwanted ones. Many mathematical theories are studied through their axioms rather than through individual structures alone.

2.1.2 Consistency

A theory is consistent if it does not prove a contradiction, or equivalently if it has at least one model, in standard first-order settings. Consistency is a minimal requirement for meaningful interpretation. Model theory often uses existence of models to establish consistency.

2.1.3 Completeness

A theory is complete if for every sentence in its language, either that sentence or its negation belongs to the theory. Complete theories have a strong uniformity: all of their models agree on every sentence. This makes them especially amenable to classification.

2.2 Elementary embeddings

Elementary embeddings preserve all first-order truths, not merely the structure of the underlying set. They provide a precise way to compare models while respecting logical form.

2.2.1 Substructures

A substructure is formed by taking a subset of a model’s domain and restricting the interpretations of symbols appropriately. Not every substructure preserves all properties of the larger structure. Elementary substructures preserve every first-order statement.

2.2.2 Isomorphisms

An isomorphism is a bijection between structures that preserves all relations, functions, and constants. Isomorphic structures are indistinguishable in the language of the theory. In model theory, they are regarded as having the same internal form.

2.2.3 Elementary equivalence

Two structures are elementarily equivalent if they satisfy exactly the same first-order sentences. They may differ as sets or combinatorial objects while remaining indistinguishable to the language. This notion is weaker than isomorphism but often more informative than mere similarity.

2.3 Definability

Definability concerns which subsets, functions, and relations can be described by formulas in a theory. It is one of the main tools for extracting structure from logical language.

2.3.1 Definable sets

A definable set is one that can be specified by a formula, possibly with free variables. Definable sets often inherit geometric or algebraic patterns from the ambient structure. Their study links model theory to algebra and geometry.

2.3.2 Parameters

Parameters are elements of a structure allowed as constants in formulas. They expand what can be defined, often making local descriptions possible. Using parameters can refine definability without changing the underlying language.

2.3.3 Interpretable structures

A structure is interpretable in another if its domain and relations can be coded using definable sets and equivalence relations. Interpretation allows one theory to simulate another. This creates a powerful bridge between seemingly different mathematical settings.

3 Fundamental theorems

Several theorems form the backbone of first-order model theory. They explain when theories have models, how large those models can be, and how proof and semantic truth correspond.

3.1 Compactness theorem

The compactness theorem states that if every finite subset of a set of sentences has a model, then the whole set has a model. It is one of the most influential results in logic.

3.1.1 Finite satisfiability

Finite satisfiability means that every finite portion of a theory can be realized in some structure. Compactness upgrades this local condition to a global existence statement. This principle is often used to build models with prescribed properties.

3.1.2 Applications

Compactness yields many nonconstructive existence results. It can produce models with infinite or unusual features from finitely consistent conditions. The theorem also helps show that certain properties cannot be axiomatized in first-order logic.

3.2 Löwenheim–Skolem theorems

The Löwenheim–Skolem theorems relate the sizes of models to the size of the language. They show that first-order theories cannot control cardinality in a rigid way.

3.2.1 Downward theorem

The downward Löwenheim–Skolem theorem says that if a theory has an infinite model, then it has a model of every smaller infinite cardinality compatible with the language. This reveals that a theory with large models often has smaller ones as well. It is a key source of noncategoricity in first-order logic.

3.2.2 Upward theorem

The upward Löwenheim–Skolem theorem states that if a theory has an infinite model, then it has arbitrarily large models. As a result, once a theory is satisfiable in infinite size, it may have models of many different cardinalities. This broad flexibility is typical of first-order theories.

3.2.3 Skolem paradox

The Skolem paradox refers to the apparent contradiction that set theory can have countable models even when it describes uncountable sets. The paradox arises from the interaction between internal and external notions of countability. It illustrates the subtlety of semantic interpretation.

3.3 Completeness theorem

The completeness theorem connects proof theory and semantics by showing that semantic consequence matches provability in first-order logic.

3.3.1 Soundness

Soundness means that anything provable from a set of axioms is true in every model of those axioms. It guarantees that syntactic derivation does not produce false conclusions. Soundness is the easy direction of the proof-semantic correspondence.

3.3.2 Gödel completeness

Gödel completeness asserts that if a sentence is true in every model of a theory, then it is provable from that theory. This theorem makes first-order logic complete in the semantic sense. It underlies many of the compactness-based methods in model theory.

4 Classification and structure

Classification theory seeks to distinguish theories according to the complexity of their models and types. It examines when models are determined up to isomorphism and how much internal diversity they contain.

4.1 Categoricity

A theory is categorical in a given cardinality if all its models of that size are isomorphic. Categoricity is a strong form of uniformity and often indicates deep structural rigidity.

4.1.1 Scott's theorem

Scott’s theorem shows that countable structures can be characterized up to isomorphism by a sentence in an infinitary logic. It provides a way to describe a specific countable model more precisely than first-order logic usually permits. The theorem is an important bridge between classical and infinitary classification.

4.1.2 Quasi-categoricity

Quasi-categoricity refers to near-categoricity, where a theory has a unique model in a broad but not absolute sense, often in some large cardinal or up to elementary equivalence. Such notions help measure how close a theory is to having a single canonical model. They are especially relevant in classification problems.

4.2 Types

Types record possible ways an element or tuple can behave relative to a set of parameters. They are central to the local analysis of models.

4.2.1 Complete types

A complete type is a maximal consistent set of formulas describing a possible tuple. It specifies every first-order property that the tuple can have over a parameter set. Complete types organize model-theoretic information into coherent packets.

4.2.2 Realized and omitted types

A type is realized if some tuple in a model satisfies all formulas in it. A type is omitted if no tuple in the model does so. The balance between realized and omitted types helps distinguish different models of the same theory.

4.2.3 Type spaces

Type spaces collect all complete types over a chosen set of parameters. They can be given topological structure, allowing logical properties to be studied geometrically. Type spaces are a major tool in modern classification theory.

4.3 Saturation and homogeneity

Saturation and homogeneity describe how richly a model contains realizations of types and how uniformly its parts behave.

4.3.1 Saturated models

A saturated model realizes as many types as its size permits. Such models are often highly representative of a theory. They serve as canonical environments for comparing definable phenomena.

4.3.2 Homogeneous models

A homogeneous model extends partial symmetries of small substructures to global automorphisms. This means that local configurations can often be moved around without changing the model. Homogeneity usually accompanies strong saturation properties.

4.3.3 Back-and-forth arguments

Back-and-forth arguments are methods for constructing isomorphisms or partial equivalences between models. They proceed by alternately extending maps in two directions. These arguments are especially useful for countable structures and saturated models.

5 Stability theory

Stability theory studies theories according to the combinatorial complexity of their types. It aims to classify those theories whose models behave in a controlled and predictable way.

5.1 Stability hierarchy

The stability hierarchy divides theories into increasingly restrictive classes based on the number and arrangement of types they permit.

5.1.1 Stable theories

Stable theories avoid the most chaotic type behavior and admit a robust independence theory. They often have well-behaved type spaces and manageable model structure. Stability is one of the central dividing lines in model theory.

5.1.2 Superstable theories

Superstable theories form a narrower class with stronger structural regularity. They support refined rank and independence analyses. Many of the deepest classification results first appear in this setting.

5.1.3 ω-stable theories

An ω-stable theory has particularly tame behavior over countable parameter sets. It has only countably many types over any countable set, up to a precise sense. These theories often admit elegant structural descriptions.

5.2 Forking and independence

Forking is a notion of dependence among formulas or types, generalizing algebraic independence in fields and other algebraic systems. It provides a framework for understanding how information splits over parameters.

5.2.1 Nonforking

Nonforking is the preferred notion of independence in stable theories. It captures when a type extends without introducing unnecessary complexity. Nonforking extensions behave in a controlled and often unique manner.

5.2.2 Independence calculus

An independence calculus is a collection of rules governing how independence interacts with symmetry, transitivity, and extension. It functions much like a geometric calculus for types. Such a calculus is essential in modern stable and simple theories.

5.2.3 Stationarity

A stationary type has a unique nonforking extension over larger parameter sets of a relevant kind. This uniqueness simplifies the analysis of model extensions. Stationarity is a key feature in many classification arguments.

5.3 Shelah's classification program

Shelah’s classification program seeks to divide theories into tame and wild families using invariants from stability theory. It is one of the major long-term projects in modern logic.

5.3.1 Types and ranks

Ranks measure the complexity of types and definable sets. They help quantify how a theory grows or branches. Higher ranks usually indicate greater combinatorial richness.

5.3.2 Minimality notions

Minimality notions identify theories or definable sets with especially simple internal structure. These notions often serve as starting points for deeper decomposition theorems. They help isolate the simplest building blocks in a theory.

5.3.3 Main gap phenomena

Main gap phenomena describe a sharp divide between theories with relatively orderly model counts and those with far more complicated behavior. This division is a hallmark of Shelah’s program. It shows that classification can separate theories into fundamentally different regimes.

6 Advanced topics

Advanced model theory includes techniques that refine expressiveness, connect logic with geometry, and build new structures from old ones. These ideas often reveal hidden regularities in familiar mathematical settings.

6.1 Quantifier elimination

Quantifier elimination is the process of rewriting formulas so that quantifiers are removed. When possible, it greatly simplifies the description of definable sets.

6.1.1 Elimination procedures

Elimination procedures transform formulas step by step into equivalent quantifier-free forms. The success of such procedures depends on the underlying theory. They are especially valuable for decision problems and definability questions.

6.1.2 Model-complete theories

A theory is model-complete if every embedding between its models is elementary. Model-complete theories often admit useful simplifications of formulas. They are closely related to, though distinct from, quantifier elimination.

6.2 O-minimality

O-minimality studies ordered structures in which definable sets in one variable are geometrically simple. It is a major framework for tame real geometry.

6.2.1 Ordered structures

Ordered structures interpret a linear order in addition to other relations or operations. O-minimality imposes strong restrictions on the definable subsets of such structures. This keeps the geometry of definable sets unusually well controlled.

6.2.2 Definable geometry

Definable geometry examines sets and functions described by formulas in an ordered structure. It often resembles classical geometry but with logic as the organizing principle. The subject has applications to algebraic and analytic objects.

6.2.3 Cell decomposition

Cell decomposition breaks definable sets into simple pieces called cells. This decomposition makes complicated definable objects easier to analyze. It is one of the defining tools of o-minimal theory.

6.3 Ultraproducts

Ultraproducts combine a family of structures into a new one using an ultrafilter. They are a powerful construction for transferring properties across models.

6.3.1 Ultrafilters

An ultrafilter is a maximal consistent notion of largeness on a set of indices. It determines which coordinatewise properties count as holding “almost everywhere.” Ultrafilters are the combinatorial engine behind ultraproducts.

6.3.2 Łoś's theorem

Łoś’s theorem states that a first-order sentence holds in an ultraproduct exactly when it holds on a set of indices belonging to the ultrafilter. This makes ultraproducts highly effective for preserving first-order information. The theorem is one of the most useful results in model theory.

6.3.3 Nonstandard models

Nonstandard models arise when ultraproducts produce structures extending familiar ones with new elements. These models often contain infinite integers, infinitesimals, or other nonclassical objects. They provide alternative viewpoints on analysis, arithmetic, and geometry.

Model theory interacts with many branches of mathematics by analyzing their structures through logical formulas. It offers a common language for comparing algebraic, geometric, and foundational systems.

7.1 Algebra

Algebra provides some of the richest sources of model-theoretic examples. Logical methods help classify equations, operations, and definable subsets in algebraic systems.

7.1.1 Fields and rings

Fields and rings are studied through theories that describe their arithmetic and algebraic behavior. Model theory has been used to analyze algebraically closed fields, real closed fields, and many specialized expansions. Definability questions in these settings often lead to deep algebraic insights.

7.1.2 Modules

Modules form a class of structures where model-theoretic methods can be especially precise. Their theories often admit clear descriptions of types and definable subgroups. This makes them an important testing ground for classification ideas.

7.1.3 Groups

Groups are examined by viewing their multiplication as a function symbol and studying definable subsets, subgroups, and actions. Model theory can reveal how group structure is encoded in first-order language. It also interacts with permutation groups and algebraic group theory.

7.2 Geometry

Model theory contributes to geometry by describing spaces and functions in logical terms. It often uncovers tame geometric behavior in algebraic and analytic contexts.

7.2.1 Differentially closed fields

Differentially closed fields are fields equipped with a derivation satisfying existential closure conditions. Their model theory captures differential equations in an algebraic language. They play a central role in the logic of differential algebra.

7.2.2 Real closed fields

Real closed fields model the first-order properties of the real numbers as an ordered field. Their theory is a classical example of quantifier elimination and o-minimality. They provide a bridge between logic and semialgebraic geometry.

7.2.3 Exponential structures

Exponential structures expand fields or ordered groups with exponential maps. They are studied because exponentiation introduces rich definability phenomena. Such structures often lie near the boundary between tame and complicated model-theoretic behavior.

7.3 Set theory and foundations

Model theory also informs foundational questions by constructing and comparing models of set theory and related systems. It clarifies the limits of formal axiomatization.

7.3.1 Internal set-theoretic models

Internal models are structures that interpret set-theoretic axioms within a larger ambient universe or theory. They are used to compare consistency strengths and relative interpretations. Model theory supplies tools for describing these models precisely.

7.3.2 Large structures

Large structures often arise as models of strong theories or as ultraproducts of many smaller systems. Their behavior can differ sharply from finite intuition. Studying them helps reveal what first-order logic can and cannot control.

7.3.3 Relative consistency

Relative consistency shows that if one theory is consistent, then another is consistent as well, often by building a model of the second from a model of the first. This method is central in foundational work. Model-theoretic constructions frequently support such arguments by providing concrete semantic witnesses.

</INTERNAL_LINK_CANDIDATES> Signature (formal specification of a language's symbols) Structure (a domain with interpretations of symbols) Satisfaction (the relation between a structure and a formula) Theory (a set of sentences describing models) Model (a structure satisfying a theory) Elementary embedding (a map preserving all first-order truths) Definable set (a set described by a formula) Parameter (an element allowed as a constant in a formula) Interpretation (a way of coding one structure inside another) Compactness theorem (finite satisfiability implies satisfiability) Löwenheim–Skolem theorems (results relating model size to language size) Completeness theorem (semantic consequence matches provability) Categoricity (uniqueness of a model in a cardinality) Type (a consistent description of possible elements) Saturation (realizing many types in a model) Homogeneity (extending partial symmetries of a model) Stability theory (classification by type complexity) Forking (a notion of dependence among types) Quantifier elimination (rewriting formulas without quantifiers) Ultraproduct (a construction combining structures via an ultrafilter)