Model theory

Model theory is a part of mathematical logic that studies how mathematical ideas and rules connect with real examples. In simple terms, it looks at how sets of rules (called formal theories) work with structures where those rules are true (called models). This helps mathematicians understand how different models relate to each other and how they use language to describe mathematical ideas.

Model theory began with Alfred Tarski in 1954, who first used the term "Theory of Models." Since the 1970s, Saharon Shelah has greatly influenced the field with his work on stability theory. Unlike proof theory, which focuses on the rules of reasoning, model theory is more about understanding meaning and truth in mathematical structures. This makes it feel closer to classical mathematics and useful in areas like algebra and geometry.

Overview

This article focuses on finitary first order model theory.

Model theory is a part of mathematical logic that studies how theories — sets of statements — relate to the structures in which those statements are true. It looks at both the models (structures) that satisfy a theory and the sets that can be defined within those models. Over time, model theory has explored both the number and size of models and the properties of the sets defined inside them. This balance between studying models and definable sets has been important for the growth of the subject.

Fundamental notions of first-order model theory

First-order logic

Main article: First-order logic

In model theory, we study how mathematical statements relate to the structures where they are true. A first-order formula is built using simple statements, called atomic formulas, and combining them with logical connectors like "and," "or," and "not." We can also use quantifiers like "for all" (∀) and "there exists" (∃) to make more complex statements.

For example, in the natural numbers (like 1, 2, 3, ...), we can express that a number is prime using a formula. This helps us understand how different mathematical structures behave and relate to each other.

Basic model-theoretic concepts

A structure gives meaning to mathematical symbols, like numbers and operations. For example, the natural numbers with addition and multiplication form a structure. When we say a structure satisfies a formula, it means the formula is true when we interpret it in that structure.

We also study theories, which are collections of statements (or sentences) that we accept as true. A theory is satisfiable if there exists at least one structure where all its statements are true.

Minimality

In some structures, only small or very large sets can be described using formulas. These are called minimal structures. For example, in the field of complex numbers, any set we can describe using formulas will either be finite (like {1, 2, 3}) or almost all elements of the field (like all numbers except a few). This idea helps us understand the limits of what we can describe in mathematics.

Definable and interpretable structures

Sometimes, we can define new structures inside existing ones using formulas. For example, we might define a subgroup inside a larger group. Even more interesting, we can sometimes "interpret" one structure inside another — basically building a new structure from parts of the original one using clear rules. This helps us understand deep connections between different areas of mathematics.

Types

Main article: Type (model theory)

Model theory studies how mathematical structures relate to the theories that describe them. It looks at how many models a theory can have, how these models connect to each other, and how they interact with the language used to describe them.

One important idea in model theory is the concept of a "type." This refers to the set of all statements that can be made about a particular sequence of elements in a structure, using certain parameters. If two sequences satisfy the same set of statements, they are said to realize the same type. This helps mathematicians understand the different ways structures can satisfy a theory's requirements.

Non-elementary model theory

Model theory has been expanded to study more complex types of mathematical structures. While basic model theory uses simple logical rules, researchers also look at higher-order logics and infinitary logics, which are more complicated. These logics don’t always follow the same rules, but model theorists have still found useful ways to study them.

Recently, scientists have focused on special kinds of models, like those that are very uniform or follow certain patterns. These studies help us understand more about mathematical structures and their properties, even when they don’t fit into the simplest logical systems.

Selected applications

Model theory has helped solve important problems in algebra. For example, it showed that certain types of number systems, like real closed fields and algebraically closed fields, have simple and predictable properties.

In the 1960s, a new method called the ultraproduct led to advances in understanding very small numbers and solving equations. Later, model theory connected to geometry and even machine learning, helping prove conjectures in advanced mathematics.

History

Model theory became a formal subject in the middle of the 20th century. The term "theory of models" was first used by Alfred Tarski in 1954. Earlier work in mathematical logic often looks like model theory when we look back on it. Important early results include the downward Löwenheim–Skolem theorem by Leopold Löwenheim in 1915 and the compactness theorem, first appearing in Kurt Gödel's work in 1930.

Later, Anatoly Maltsev gave these theorems their full forms. Tarski helped make model theory an independent area of study, working on topics like logical consequence and the semantic definition of truth. In the 1960s, new tools like ultraproducts were used, and researchers began studying model theory for different kinds of algebra. Later developments, such as stability theory by Shelah, introduced new ideas that connected model theory to geometry.

Connections to related branches of mathematical logic

Finite model theory

Main article: Finite model theory

Finite model theory studies structures that have a limited, or "finite," size. This area is different from studying very large, or "infinite," structures. Some important results in traditional model theory do not work when only finite structures are considered. These include the compactness theorem, Gödel's completeness theorem, and the method of ultraproducts for first-order logic. Finite model theory has useful applications in areas like descriptive complexity theory, database theory, and formal language theory.

Set theory

Set theory, when expressed in a countable language, always has a countable model. This seems strange because set theory includes statements about very large, or "uncountable," sets. The model theory view has helped in set theory, especially in the work of Kurt Gödel and methods developed by Paul Cohen. Model theory itself is built using Zermelo–Fraenkel set theory. Some results in model theory depend on special set theory assumptions, and questions from model theory have links to very large numbers in set theory.