L(R)

The smallest transitive inner model of ZF containing every ordinal and every real, constructed by iterating definability from the real numbers and used to study determinacy under large-cardinal assumptions.

Version

v1 · 2026-09-08 · History

Domain-specific #

5237

Origin domain

set theory

Subdomain

inner models and determinacy

Core Idea

L(R), read L of R, is the minimal transitive inner model containing all ordinals and all reals, built like Gödel's L but beginning with R. Starting from transitive data containing the reals, successive stages add subsets definable over the previous stage with parameters; union at limit ordinals yields a canonical hierarchy. 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

L(R) belongs to set theory and is useful where the analyst can specify the class of ordinals, the set of all reals, transitive stages and the definable-powerset operation, then evaluate the construction contains all actual reals and ordinals, uses the declared definability hierarchy and yields the least transitive ZF model with those elements. The scope is broad within that domain but bounded by the need for the construction contains all actual reals and ordinals, uses the declared definability hierarchy and yields the least transitive ZF model with those elements. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the construction contains all actual reals and ordinals, uses the declared definability hierarchy and yields the least transitive ZF model with those elements the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name L(R) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 L(R). L(R) 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

1. Identify the carrier. State what the elements, states, objects, or observations are: the class of ordinals, the set of all reals, transitive stages and the definable-powerset operation. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the construction contains all actual reals and ordinals, uses the declared definability hierarchy and yields the least transitive ZF model with those elements independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of set theory because they reuse the class of ordinals, the set of all reals, transitive stages and the definable-powerset operation, Starting from transitive data containing the reals, successive stages add subsets definable over the previous stage with parameters; union at limit ordinals yields a canonical hierarchy., and type the carrier, state every parameter and convention in the definition, test that the construction contains all actual reals and ordinals, uses the declared definability hierarchy and yields the least transitive ZF model with those elements, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction L(R) Domain-specific

Parents (1) — more general patterns this builds on

• L(R) is a kind of Hierarchy Prime

  The proposed strict upward parent is prime:hierarchy.

Hierarchy paths (4) — routes to 4 parentless roots

• L(R) → Hierarchy → Network → Reservoir-Flux Network → Conservation Laws → Invariance

Show alternative paths (3)

Neighborhood in Abstraction Space

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

Family — Order, Lattices & Set Relations (36 abstractions)

Nearest neighbors

• Ordinal definable set — 0.93
• Continuous function (ordinal theory) — 0.90
• Definable set — 0.89
• Admissible set — 0.89
• Normal function — 0.89

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