In
model theory
In mathematical logic, model theory is the study of the relationship between formal theories (a collection of sentences in a formal language expressing statements about a mathematical structure), and their models (those structures in which the ...
, a branch of
mathematical logic
Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research in mathematical logic commonly addresses the mathematical properties of formal ...
, a
complete
Complete may refer to:
Logic
* Completeness (logic)
* Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable
Mathematics
* The completeness of the real numbers, which implies ...
first-order theory
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifie ...
''T'' is called stable in λ (an infinite
cardinal number
In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. T ...
), if the
Stone space In topology and related areas of mathematics, a Stone space, also known as a profinite space or profinite set, is a compact totally disconnected Hausdorff space. Stone spaces are named after Marshall Harvey Stone who introduced and studied them in ...
of every
model
A model is an informative representation of an object, person or system. The term originally denoted the plans of a building in late 16th-century English, and derived via French and Italian ultimately from Latin ''modulus'', a measure.
Models c ...
of ''T'' of size ≤ λ has itself size ≤ λ. ''T'' is called a stable theory if there is no upper bound for the cardinals κ such that ''T'' is stable in κ. The stability spectrum of ''T'' is the class of all cardinals κ such that ''T'' is stable in κ.
For countable theories there are only four possible stability spectra. The corresponding
dividing lines are those for
total transcendentality,
superstability and
stability
Stability may refer to:
Mathematics
* Stability theory, the study of the stability of solutions to differential equations and dynamical systems
** Asymptotic stability
** Linear stability
** Lyapunov stability
** Orbital stability
** Structural st ...
. This result is due to
Saharon Shelah
Saharon Shelah ( he, שהרן שלח; born July 3, 1945) is an Israeli mathematician. He is a professor of mathematics at the Hebrew University of Jerusalem and Rutgers University in New Jersey.
Biography
Shelah was born in Jerusalem on July ...
, who also defined stability and superstability.
The stability spectrum theorem for countable theories
Theorem.
Every countable complete first-order theory ''T'' falls into one of the following classes:
* ''T'' is stable in λ for all infinite cardinals λ—''T'' is totally transcendental.
* ''T'' is stable in λ exactly for all cardinals λ with λ ≥ 2
ω—''T'' is superstable but not totally transcendental.
* ''T'' is stable in λ exactly for all cardinals λ that satisfy λ = λ
ω—''T'' is stable but not superstable.
* ''T'' is not stable in any infinite cardinal λ—''T'' is unstable.
The condition on λ in the third case holds for cardinals of the form λ = κ
ω, but not for cardinals λ of cofinality ω (because λ < λ
cof λ).
Totally transcendental theories
A complete first-order theory ''T'' is called totally transcendental if every formula has bounded
Morley rank In mathematical logic, Morley rank, introduced by , is a means of measuring the size of a subset of a model of a theory, generalizing the notion of dimension in algebraic geometry.
Definition
Fix a theory ''T'' with a model ''M''. The Morley ran ...
, i.e. if RM(φ) < ∞ for every formula φ(''x'') with parameters in a model of ''T'', where ''x'' may be a tuple of variables. It is sufficient to check that RM(''x''=''x'') < ∞, where ''x'' is a single variable.
For countable theories total transcendence is equivalent to stability in ω, and therefore countable totally transcendental theories are often called ω-stable for brevity. A totally transcendental theory is stable in every λ ≥ , ''T'', , hence a countable ω-stable theory is stable in all infinite cardinals.
Every
uncountably categorical countable theory is totally transcendental. This includes complete theories of vector spaces or algebraically closed fields. The theories of
groups of finite Morley rank are another important example of totally transcendental theories.
Superstable theories
A complete first-order theory ''T'' is superstable if there is a rank function on complete types that has essentially the same properties as Morley rank in a totally transcendental theory. Every totally transcendental theory is superstable. A theory ''T'' is superstable if and only if it is stable in all cardinals λ ≥ 2
, ''T'', .
Stable theories
A theory that is stable in one cardinal λ ≥ , ''T'', is stable in all cardinals λ that satisfy λ = λ
, ''T'', . Therefore a theory is stable if and only if it is stable in some cardinal λ ≥ , ''T'', .
Unstable theories
Most mathematically interesting theories fall into this category, including complicated theories such as any complete extension of ZF set theory, and relatively tame theories such as the theory of real closed fields. This shows that the stability spectrum is a relatively blunt tool. To get somewhat finer results one can look at the exact cardinalities of the Stone spaces over models of size ≤ λ, rather than just asking whether they are at most λ.
The uncountable case
For a general stable theory ''T'' in a possibly uncountable language, the stability spectrum is determined by two cardinals κ and λ
0, such that ''T'' is stable in λ exactly when λ ≥ λ
0 and λ
μ = λ for all μ<κ. So λ
0 is the smallest infinite cardinal for which ''T'' is stable. These invariants satisfy the inequalities
*κ ≤ , ''T'',
+
*κ ≤ λ
0
*λ
0 ≤ 2
, ''T'',
*If λ
0 > , ''T'', , then λ
0 ≥ 2
ω
When , ''T'', is countable the 4 possibilities for its stability spectrum correspond to the following values of these cardinals:
*κ and λ
0 are not defined: ''T'' is unstable.
*λ
0 is 2
ω, κ is ω
1: ''T'' is stable but not superstable
*λ
0 is 2
ω, κ is ω: ''T'' is superstable but not ω-stable.
* λ
0 is ω, κ is ω: ''T'' is totally transcendental (or ω-stable)
See also
*
Spectrum of a theory
In model theory, a branch of mathematical logic, the spectrum of a theory
is given by the number of isomorphism classes of models in various cardinalities. More precisely,
for any complete theory ''T'' in a language we write ''I''(''T'', ''κ' ...
References
* Translated from the French
*{{Citation , last1=Shelah , first1=Saharon , author1-link=Saharon Shelah , title=Classification theory and the number of nonisomorphic models , origyear=1978 , publisher=Elsevier , edition=2nd , series=Studies in Logic and the Foundations of Mathematics , isbn=978-0-444-70260-9 , year=1990 , url-access=registration , url=https://archive.org/details/classificationth0092shel
Model theory