In model theory, a forking extension of a type is an extension of that type that is not free[ clarify ] whereas a non-forking extension is an extension that is as free as possible. This can be used to extend the notions of linear or algebraic independence to stable theories. These concepts were introduced by S. Shelah.
Suppose that A and B are models of some complete ω-stable theory T. If p is a type of A and q is a type of B containing p, then q is called a forking extension of p if its Morley rank is smaller, and a nonforking extension if it has the same Morley rank.
Let T be a stable complete theory. The non-forking relation ≤ for types over T is the unique relation that satisfies the following axioms:
In mathematics, the continuum hypothesis is a hypothesis about the possible sizes of infinite sets. It states:
There is no set whose cardinality is strictly between that of the integers and the real numbers.
In mathematics, more precisely in mathematical logic, model theory is the study of the relationship between formal theories, and their models, taken as interpretations that satisfy the sentences of that theory. The aspects investigated include the number and size of models of a theory, the relationship of different models to each other, and their interaction with the formal language itself. In particular, model theorists also investigate the sets that can be defined in a model of a theory, and the relationship of such definable sets to each other. As a separate discipline, model theory goes back to Alfred Tarski, who first used the term "Theory of Models" in publication in 1954. Since the 1970s, the subject has been shaped decisively by Saharon Shelah's stability theory. The relative emphasis placed on the class of models of a theory as opposed to the class of definable sets within a model fluctuated in the history of the subject, and the two directions are summarised by the pithy characterisations from 1973 and 1997 respectively:
In mathematics, a weakly compact cardinal is a certain kind of cardinal number introduced by Erdős & Tarski (1961); weakly compact cardinals are large cardinals, meaning that their existence cannot be proven from the standard axioms of set theory.
In mathematical logic, the Löwenheim–Skolem theorem is a theorem on the existence and cardinality of models, named after Leopold Löwenheim and Thoralf Skolem.
In mathematical logic, and particularly in its subfield model theory, a saturated modelM is one that realizes as many complete types as may be "reasonably expected" given its size. For example, an ultrapower model of the hyperreals is -saturated, meaning that every descending nested sequence of internal sets has a nonempty intersection, see Goldblatt (1998).
In mathematical logic, a theory is categorical if it has exactly one model. Such a theory can be viewed as defining its model, uniquely characterizing its structure.
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, α) for the number of models of T of cardinality α. The spectrum problem is to describe the possible behaviors of I(T, α) as a function of α. It has been almost completely solved for the case of a countable theory T.
In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.
In mathematics, a differential field K is differentially closed if every finite system of differential equations with a solution in some differential field extending K already has a solution in K. This concept was introduced by Robinson (1959). Differentially closed fields are the analogues for differential equations of algebraically closed fields for polynomial equations.
In set theory, an Aronszajn tree is an uncountable tree with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal κ, a κ-Aronszajn tree is a tree of cardinality κ in which all levels have size less than κ and all branches have height less than κ. They are named for Nachman Aronszajn, who constructed an Aronszajn tree in 1934; his construction was described by Kurepa (1935).
In model theory, a branch of mathematical logic, a complete first-order theory T is called stable in λ, if the Stone space of every model 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 κ.
In the mathematical field of model theory, a complete theory is called stable if it does not have too many types. One goal of classification theory is to divide all complete theories into those whose models can be classified and those whose models are too complicated to classify, and to classify all models in the cases where this can be done. Roughly speaking, if a theory is not stable then its models are too complicated and numerous to classify, while if a theory is stable there might be some hope of classifying its models, especially if the theory is superstable or totally transcendental.
In mathematics, infinitary combinatorics, or combinatorial set theory, is an extension of ideas in combinatorics to infinite sets. Some of the things studied include continuous graphs and trees, extensions of Ramsey's theorem, and Martin's axiom. Recent developments concern combinatorics of the continuum and combinatorics on successors of singular cardinals.
In the mathematical field of set theory, the Solovay model is a model constructed by Robert M. Solovay (1970) in which all of the axioms of Zermelo–Fraenkel set theory (ZF) hold, exclusive of the axiom of choice, but in which all sets of real numbers are Lebesgue measurable. The construction relies on the existence of an inaccessible cardinal.
In model theory, a discipline within mathematical logic, an abstract elementary class, or AEC for short, is a class of models with a partial order similar to the relation of an elementary substructure of an elementary class in first-order model theory. They were introduced by Saharon Shelah.
This is a glossary of set theory.
In model theory, a discipline within the field of mathematical logic, a tame abstract elementary class is an abstract elementary class (AEC) which satisfies a locality property for types called tameness. Even though it appears implicitly in earlier work of Shelah, tameness as a property of AEC was first isolated by Grossberg and VanDieren, who observed that tame AECs were much easier to handle than general AECs.