IndisputableMonolith.Foundation.MaximalForcing.ForcingClosure
Defines the claim universe and closure operators for one maximal-forcing pass: which realizations remain admissible and which claims sit inside the forced set. Foundation authors cite it when stating that a law is forced rather than optional. The module is definitional scaffolding over admissible realization classes; no deep proof work lives here.
claimA claim universe $\mathcal{U}$ pairs an admissible realization class with a set of claims. The forcing closure $\mathrm{Cl}(\mathcal{U})$ is the smallest extension closed under the maximal-forcing rules; a claim $C$ is in closure when $C \in \mathrm{Cl}(\mathcal{U})$.
background
Maximal forcing, in the Recognition Science foundation layer, refuses to leave free parameters unexamined. The upstream admissible-realization module states the policy: if a claim is not forced on the current class, either tighten admissibility by a deeper law, or exhibit independence by countermodel.
This module supplies the bookkeeping objects for one such pass. A claim universe packages the current admissible realizations together with the claims under consideration. Forcing closure is the operator that saturates that universe under the forcing rules; membership in closure is the predicate that a claim has been forced rather than left open.
The local setting is purely structural: no physical constants or J-cost identities are proved here. The objects feed the independence-witness layer, which demands an explicit countermodel pair whenever closure fails.
proof idea
This is a definition module, no proofs. It introduces the claim-universe carrier, the forcing-closure operator on that carrier, and the in-closure membership predicate. Downstream modules import these names and discharge concrete forcing or independence obligations against them.
why it matters in Recognition Science
Without a named closure operator, "forced" remains informal. This module pins the vocabulary so that IndependenceWitness can require a countermodel pair whenever a claim lies outside closure, matching its doc-comment: if a claim is not forced, maximal closure demands a countermodel pair rather than a vague appeal to contingency.
In the broader forcing chain (T0–T8), maximal forcing is the methodological stance that uniqueness results (J-cost, $\varphi$, eight-tick period, $D=3$) are not modeling choices. ForcingClosure is the local type-level hook those uniqueness arguments sit on when packaged as forced claims inside an admissible class.
Parent consumer: IndependenceWitness imports this module to state non-forcing obligations rigorously.
scope and limits
- Does not prove any concrete physical law is forced.
- Does not construct countermodels; that is IndependenceWitness.
- Does not define admissible realization classes; imports them.
- Does not reference J-cost, phi, or T5–T8 identities directly.
- Does not assert completeness of the claim universe over all RS propositions.