Admissible set¶

A transitive set whose membership structure satisfies Kripke–Platek set theory.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3218
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Set Theory → Mathematics

Core Idea¶

Admissibility depends on the precise KP axiom convention and urelements if any, transitivity is constitutive and an admissible ordinal is an ordinal whose constructible level is admissible rather than the same object as an admissible set. Closure and collection principles strong enough for rudimentary recursion hold inside the transitive set, making it a universe for definability and recursion theory weaker than full ZF. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. Two of three generators judged it N/A: any five-year-old picture collapses into a closed box whose contents' contents are inside, which reduces admissibility to mere transitive closure and loses the Kripke-Platek axioms and its weaker-than-full-set-theory status.

A Small Self-Contained Set World

In set theory, sets can contain other sets, like boxes inside boxes. An admissible set is a set that is 'transitive': anything inside one of its members is also a member. It also follows a special list of rules, called Kripke–Platek rules, which make it closed enough that you can do certain step-by-step constructions and definitions entirely inside it. Those rules are weaker than the full rules most mathematicians use, so an admissible set is a smaller, more limited math world.

Kripke–Platek Transitive Set

An admissible set is a transitive set A (every element of an element of A is itself in A) which, using membership restricted to A, satisfies the Kripke–Platek (KP) axioms. KP includes basic principles like extensionality, foundation, pairing, union and infinity, plus weakened forms of separation and collection that only use bounded formulas. These are strong enough to support simple recursion and definitions inside A, but weaker than ZF, the standard foundation of math, so an admissible set need not be a model of ZF. Exactly which axioms count depends on the convention used, including whether urelements (non-set objects) are allowed. A related but different idea is an admissible ordinal: an ordinal α whose constructible level L_α is an admissible set.

An admissible set is a transitive set A such that (A, ∈ restricted to A) satisfies Kripke–Platek set theory under a specified axiom convention, possibly with urelements. KP comprises extensionality, foundation, pairing, union, infinity, and Δ0 (bounded) separation and collection, with details varying by presentation. Transitivity is constitutive, not optional. These closure and collection principles suffice for rudimentary recursion and yield useful absoluteness properties, making admissible sets natural universes for definability and generalized recursion theory, while remaining much weaker than models of ZF. Constructible levels L_α supply standard examples. An admissible ordinal is an ordinal α such that L_α is admissible; it is a distinct object from an admissible set, not a synonym. Confirming admissibility requires fixing the axiom convention and checking transitivity and each KP axiom within A.

Scope of Application¶

Admissible set belongs to set theory and is useful where the analyst can specify the typed set theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the transitive set A, structure with membership restricted to A, Kripke–Platek axioms including extensionality foundation pairing union infinity and bounded separation and collection under the chosen convention, absoluteness and closure properties, constructible levels L-alpha, admissible ordinals and examples and distinction from models of ZF are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the transitive set A, structure with membership restricted to A, Kripke–Platek axioms including extensionality foundation pairing union infinity and bounded separation and collection under the chosen convention, absoluteness and closure properties, constructible levels L-alpha, admissible ordinals and examples and distinction from models of ZF are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Admissible set. Admissible set compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed set theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the transitive set A, structure with membership restricted to A, Kripke–Platek axioms including extensionality foundation pairing union infinity and bounded separation and collection under the chosen convention, absoluteness and closure properties, constructible levels L-alpha, admissible ordinals and examples and distinction from models of ZF are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of set theory because they reuse the typed set theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Closure and collection principles strong enough for rudimentary recursion hold inside the transitive set, making it a universe for definability and recursion theory weaker than full ZF., and type the carrier, state every parameter and convention in the definition, test that the transitive set A, structure with membership restricted to A, Kripke–Platek axioms including extensionality foundation pairing union infinity and bounded separation and collection under the chosen convention, absoluteness and closure properties, constructible levels L-alpha, admissible ordinals and examples and distinction from models of ZF are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Admissible set Domain-specific

Parents (1) — outgoing typed relations

Admissible set is a kind of Formalization Prime

It remains its own entry because its identity is fixed by the transitive set A, structure with membership restricted to A, Kripke–Platek axioms including extensionality foundation pairing union infinity and bounded separation and collection under the chosen convention, absoluteness and closure properties, constructible levels L-alpha, admissible ordinals and examples and distinction from models of ZF.

Hierarchy paths (2) — routes to 2 parentless roots

Admissible set → is a kind of Formalization → presupposes Representation → presupposes Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Admissible set sits in a crowded region of the domain-specific corpus (10^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Set-Theoretic & Order Structures (54 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25