Model theory

Model theory is a part of mathematical logic that studies how math ideas match real examples. It looks at how rules work with structures where those rules are true. This helps mathematicians see how different models connect and how they use language to talk about math.

Model theory started with Alfred Tarski in 1954. He first used the term "Theory of Models." Since the 1970s, Saharon Shelah has helped shape the field with his work. Unlike proof theory, which looks at rules for reasoning, model theory focuses on meaning and truth in math structures. This makes it 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. It studies how groups of statements relate to the structures where those statements are true. It looks at the models that fit a theory and the sets that can be described inside those models. Over time, model theory has looked at how many models there are, how big they are, and the properties of the sets inside them. Studying both models and describable sets has helped the subject grow.

Fundamental notions of first-order model theory

First-order logic

Main article: First-order logic

In model theory, we look at how math statements fit with the rules of the structures where they are true. A first-order formula is made from simple statements, called atomic formulas, and joined with words like "and," "or," and "not." We can also use words like "for all" (∀) and "there exists" (∃) to make more detailed statements.

For example, in the natural numbers (like 1, 2, 3, ...), we can write a formula to say a number is prime. This shows us how different math systems work and relate.

Basic model-theoretic concepts

A structure gives meaning to math 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 use that structure.

We also study theories, which are groups of statements (or sentences) that we say are true. A theory is satisfiable if there is 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 with formulas will either have very few elements (like {1, 2, 3}) or almost all elements of the field (like all numbers except a few). This idea helps us learn about what we can and cannot describe in math.

Definable and interpretable structures

Sometimes, we can create new structures inside bigger ones using formulas. For example, we might define a smaller group inside a larger group. Even more interesting, we can sometimes "interpret" one structure inside another — building a new structure from pieces of the original one using clear rules. This helps us see important links between different parts of math.

Types

Main article: Type (model theory)

Model theory is a part of math that studies how different systems relate to the ideas that describe them. It looks at how many different systems a idea can have, how these systems connect, and how they work with the words used to talk about them.

One key idea in model theory is called a "type." A type is all the things we can say about a group of items in a system, using some fixed points as guides. If two groups of items follow the same rules, they are said to have the same type. This helps mathematicians see the many ways systems can fit the rules of a idea.

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.

Selected applications

Model theory has helped solve important problems in algebra. It showed that certain types of number systems, like real closed fields and algebraically closed fields, behave in simple and predictable ways.

In the 1960s, a new method called the ultraproduct helped us understand very small numbers better and solve tough equations. Later, model theory connected to geometry and even machine learning, helping prove important ideas 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 think about it now.

Important early results include the downward Löwenheim–Skolem theorem by Leopold Löwenheim in 1915 and the compactness theorem, which first appeared in Kurt Gödel's work in 1930.

Later, Anatoly Maltsev developed these theorems further. 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 looks at structures that have a limited size, called "finite." This is different from studying very large structures, called "infinite." Some important results in traditional model theory do not work when we only look at finite structures. These include the compactness theorem, Gödel's completeness theorem, and the method of ultraproducts for first-order logic. Finite model theory has useful uses in areas like descriptive complexity theory, database theory, and formal language theory.

Set theory

Set theory, when written in a countable language, always has a countable model. This can seem odd because set theory talks 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 by Paul Cohen. Model theory itself is built using Zermelo–Fraenkel set theory. Some results in model theory rely on special set theory ideas, and questions from model theory connect to very large numbers in set theory.