Admissible set¶

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

Version: v1 · 2026-09-08 · History
Domain-specific #: 3218
Origin domain: set theory
Subdomain: set theory

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.

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. 2. 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) — more general patterns this builds on

Admissible set is a kind of Formalization Prime

The proposed strict upward parent is prime:formalization.

Hierarchy paths (2) — routes to 2 parentless roots

Admissible set → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

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

Family — Constructive Set & Order Systems (8 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08