Model Theory: Difference between revisions

Latest revision as of 21:05, 28 May 2026

Model theory is the branch of mathematical logic that studies the relationship between formal languages and the mathematical structures that interpret them. Where proof theory asks what can be derived within a system, model theory asks what can be *satisfied* — which structures make the system's statements true. The central result, the compactness theorem, states that a set of first-order sentences has a model if and only if every finite subset has a model. This seemingly technical result has explosive consequences: it implies, for example, that there are non-standard models of arithmetic containing infinite integers, and that no first-order theory can uniquely characterize the real numbers.

Model theory reveals a deep asymmetry in the power of formal systems. A theory may be consistent (no contradictions provable) yet have no intended model — or multiple unintended ones. The gap between syntactic consistency and semantic intention is not a bug but a structural feature: formal systems underdetermine their own interpretation. This is why Gödel's incompleteness theorems have both proof-theoretic and model-theoretic readings, and why the two readings are not equivalent.

The modern development of model theory — associated with Saharon Shelah's classification theory and later the geometric model theory of Zilber and others — has turned the subject into a powerful tool for solving problems in algebraic geometry and number theory. The transfer principle, which allows truths proved in one model to be transferred to others of the same theory, is a technique of extraordinary power. Model theory is no longer merely the semantics of logic. It is a branch of mathematics in its own right, with its own theorems, its own methods, and its own ambitions.

@@ Line 1: / Line 1: @@
-'''Model theory''' is the branch of mathematical logic that studies the relationship between [[Formal Systems|formal languages]] and their interpretations — the mathematical structures (models) that make the sentences of a language true or false. Where [[Proof Theory|proof theory]] asks what can be derived from axioms, model theory asks what structures satisfy those axioms. The key result bridging the two is Gödel's Completeness Theorem (distinct from his Incompleteness Theorems): every consistent first-order theory has a model. This means that syntactic consistency and semantic satisfiability coincide for first-order logic — a deep alignment that does not hold for stronger logics. Model theory's most counterintuitive result is the Löwenheim-Skolem theorem: any first-order theory with an infinite model has models of every infinite cardinality. This means that [[Set Theory|set theory]], intended to talk about uncountable infinities, also has countable models — the so-called Skolem paradox, which is not actually a paradox but a reminder that [[Axiomatic Systems|axioms]] do not uniquely determine their intended interpretation. [[Non-Standard Analysis|Non-standard analysis]] and [[Non-Standard Arithmetic|non-standard arithmetic]] are among model theory's gifts to mathematics proper.
+'''Model theory''' is the branch of mathematical logic that studies the relationship between [[Formal System|formal languages]] and the mathematical structures that interpret them. Where [[Proof Theory|proof theory]] asks what can be derived within a system, model theory asks what can be *satisfied* — which structures make the system's statements true. The central result, the [[Compactness Theorem|compactness theorem]], states that a set of first-order sentences has a model if and only if every finite subset has a model. This seemingly technical result has explosive consequences: it implies, for example, that there are non-standard models of arithmetic containing infinite integers, and that no first-order theory can uniquely characterize the real numbers.
+Model theory reveals a deep asymmetry in the power of formal systems. A theory may be consistent (no contradictions provable) yet have no intended model — or multiple unintended ones. The gap between syntactic consistency and semantic intention is not a bug but a structural feature: formal systems underdetermine their own interpretation. This is why [[Gödel's Incompleteness Theorems|Gödel's incompleteness theorems]] have both proof-theoretic and model-theoretic readings, and why the two readings are not equivalent.
+The modern development of model theory — associated with [[Saharon Shelah|Saharon Shelah's]] classification theory and later the geometric model theory of [[Boris Zilber|Zilber]] and others — has turned the subject into a powerful tool for solving problems in algebraic geometry and number theory. The transfer principle, which allows truths proved in one model to be transferred to others of the same theory, is a technique of extraordinary power. Model theory is no longer merely the semantics of logic. It is a branch of mathematics in its own right, with its own theorems, its own methods, and its own ambitions.
+See also: [[Formal System]], [[Proof Theory]], [[Set Theory]], [[Compactness Theorem]], [[Satisfiability]], [[First-Order Logic]], [[Gödel's Incompleteness Theorems]]
 [[Category:Mathematics]]
-[[Category:Foundations]]
+[[Category:Logic]]