Axiom 2026-10-14
An axiom is a sentence admitted as a starting assumption of a formal theory. An axiom schema specifies a collection of such sentences, usually one for each formula of an allowed form. A model of a first-order theory satisfies all its axioms; a relative consistency construction can show that the other axioms do not imply a particular omitted one.
Categorical theory Created 2026-09-24 Updated 2026-11-05
A first-order theory is -categorical when it has a model of a first-order theory of cardinality and any two such models of a first-order theory are isomorphic. Existence is required, so a missing model size does not make categoricity vacuously true.
First-order logic Created 2026-09-24 Updated 2026-11-05
First-order logic builds assertions using variables, logical connectives, and quantifiers over elements of a structure. A chosen first-order language supplies constants, function symbols, and relation symbols. The quantifiers range over elements, rather than arbitrary subsets or predicates.
For example, says that an ordered domain has no greatest element. It is true in the integers but false in a nonempty finite total order. A formal proof manipulates formulas syntactically, while a model of a first-order theory supplies their meanings. Gödel's completeness theorem links these viewpoints: semantic consequence from a theory agrees with formal derivability.
Forcing Created 2026-09-24 Updated 2026-11-05
Forcing constructs a generic extension of a model of a first-order theory of set theory from a partially ordered set in . A condition specifies partial information about a new object; in the standard order, means that specifies stronger information. A generic filter meets every dense subset of a forcing order belonging to . The elements of are obtained by evaluating forcing names from using .
For Cohen forcing, conditions are finite partial functions from to . Their union is a new binary sequence. Dense requirements make the sequence total and ensure that it differs from each old binary sequence. When is a countable transitive model, one can enumerate its dense sets externally and successively choose stronger conditions meeting them. This construction is conditional on having such a model; consistency of ZFC alone does not assert the existence of a countable transitive model.
The forcing theorem makes this method useful for proofs: the forcing relation is definable in the ground model, and truth in the generic extension is witnessed by a condition in the generic filter.
Model theory Created 2026-09-24 Updated 2026-11-05
Model theory studies mathematical first-order structures through the first-order formulas they satisfy. A theory specifies sentences, while a model of a first-order theory gives a domain and interpretations of the nonlogical symbols making those sentences true.
For example, dense total orders without endpoints have a common complete first-order theory, although a countable such order and the real line cannot be isomorphic. The Löwenheim-Skolem theorem and compactness theorem explain why first-order truth can leave cardinality and other global structure undetermined. Quantifier elimination, complete types, and elementary embeddings provide tools for describing exactly what a theory can distinguish.
Suppose that a first-order formula described the inaccessible cardinal , so that were the least ordinal with . Since is inaccessible, is a model of ZFC. Apply the Lévy reflection theorem inside this model to the single formula . There is some for which
The right side holds, so the left side contradicts the asserted minimality of . Hence no first-order formula describes an inaccessible cardinal, as recorded by ordinal described by a first-order formula.
The compactness theorem says that a set of first-order sentences has a model if and only if every finite subset of has a model. One implication follows by taking the same model. Conversely, if had no model, then by the Godel completeness theorem it would prove a contradiction. A formal proof uses only finitely many assumptions, so some finite subset of would already have no model. This contradiction proves compactness.
The Upward Lowenheim-Skolem theorem says that if an -theory has an infinite model, then it has models of arbitrarily large cardinality; more precisely, it has a model of cardinality at least for every cardinal . Add new constants for and the sentences
Every finite subset of the enlarged theory can be interpreted in the given infinite model, since it mentions only finitely many constants. Compactness supplies a model of the whole enlarged theory, in which the are pairwise distinct. Its reduct to is a model of having at least elements. If , the Downward Lowenheim-Skolem theorem gives a model of cardinality exactly .
Since the strongly inaccessible cardinal is inaccessible, is a model of ZFC. The Downward Lowenheim-Skolem theorem gives an elementary substructure
of cardinality such that
One may obtain concretely as the Skolem hull of this set; its cardinality remains because the language of set theory is countable and .
Apply the Mostowski collapse theorem to and write for the collapse. Then is a transitive set, , and fixes pointwise. It also fixes , because it fixes every ordinal below . By elementarity, satisfies ZFC and regards as a kappa-complete filter that is a nonprincipal ultrafilter on . Therefore, with ,
The internal ultrafilter need not equal the original .
Relative consistency 2026-10-14
A relative-consistency result constructs a model of a first-order theory , or interprets its proofs, from the assumed consistency of a background theory . It establishes in the stated metatheory, not an unconditional proof of consistency. For independence of an axiom from , obtain consistent models of both and , relative to the background assumption.
Weakly compact cardinal Created 2026-09-24 Updated 2026-11-05
A weakly compact cardinal is an uncountable cardinal satisfying the weak compactness properties of infinitary mathematical logic and set theory. One formulation requires compactness for theories of size at most : if every subtheory of size below has a model of a first-order theory, the whole theory has one. The logic permits conjunctions and quantifier blocks of length below .
Equivalently, is strongly inaccessible and has the tree property, and it satisfies the partition relation . These link logical consistency, the existence of long branches in trees, and homogeneous subsets for pair colorings. Such a cardinal is therefore a substantial strengthening of uncountability, rather than an arbitrary infinite cardinal.