Foundation Universal Forcing Strict Realization Strict Logic Realization

The strict interface

A recognition ledger, a discrete record of events, needs a way to compare, combine, and identify its entries. The Recognition Science framework's machine-checked library of formal theorems asks how much structure such a ledger must carry before it can generate the natural numbers. The declaration StrictLogicRealization answers: a strict realization supplies only native comparison, composition, identity, invariance, and non-triviality data. It does not allow the caller to hand over a ready-made counting orbit as a field.

Earlier, the LogicRealization interface proved the lightweight Universal Forcing theorem, but it let a realization carry an internal orbit as a field. That orbit was an escape hatch: the counting structure could be imported rather than derived. The strict interface closes that hatch. In a strict realization, the free orbit is uniformly the LogicNat iteration object, and its interpretation into the carrier is defined by primitive recursion over the native generator and composition operation. The result is that every strict realization has forced arithmetic canonically equivalent to LogicNat.

In Recognition Science, Universal Forcing is the claim that any realization satisfying the five plain conditions must produce the same arithmetic structure. The strict interface strengthens this by removing the supplied orbit from the main theorem path. The theorem universal_forcing then states that for any two strict realizations, their Peano carriers are equivalent. The Peano surface, the structure of zero and successor, is inherited from the derived free orbit, not from any external input.

What the strict interface does not claim is that a realization can be constructed without any data at all. It still requires the five native law components: comparison, composition, identity, invariance, and non-triviality. It does not claim that the natural numbers are the only possible arithmetic, only that any strict realization's arithmetic is canonically equivalent to LogicNat. And it does not claim that the physical world must obey this structure; that is a separate empirical bridge, not a theorem of the library.

The consequence is that counting structure, in this account, is not a primitive assumption but a forced output. A reader can now see that the framework's arithmetic does not depend on a chosen model of the natural numbers; it emerges from the minimal logical ingredients that any recognition ledger must have.

/-- A strict Law-of-Logic realization: native law data only, no supplied orbit. -/
structure StrictLogicRealization where
  Carrier : Type u
  Cost : Type v
  zeroCost : Zero Cost
  compare : Carrier → Carrier → Cost
  compose : Carrier → Carrier → Carrier
  one : Carrier
  generator : Carrier
  identity_law : ∀ x : Carrier, compare x x = 0
  non_contradiction_law : ∀ x y : Carrier, compare x y = compare y x
  excluded_middle_law : Prop
  composition_law : Prop
  invariance_law : Prop
  nontrivial_law : compare generator one ≠ 0

/-- The strict free orbit is uniformly the `LogicNat` iteration object. -/
abbrev FreeOrbit (_R : StrictLogicRealization) : Type :=
  LogicNat

/-- Every strict realization has forced arithmetic canonically equivalent to
`LogicNat`. -/
def arith_equiv_logicNat (R : StrictLogicRealization) :
    (arith R).peano.carrier ≃ LogicNat :=
  (toLightweight R).orbitEquivLogicNat

/-- Universal forcing for strict realizations. -/
noncomputable def universal_forcing (R S : StrictLogicRealization) :
    (arith R).peano.carrier ≃ (arith S).peano.carrier :=
  ArithmeticOf.equivOfInitial (arith R) (arith S)

What this page does not claim

A strict realization can be constructed without any data at all. The natural numbers are the only possible arithmetic structure. The physical world must obey this structure. The strict interface proves the Riemann Hypothesis or any other open mathematical conjecture.

Verify this page

Every tagged claim above names its theorem. To check one yourself rather than trust this page, elaborate the source module with Lean 4 and audit its axiom basis:

$ lake env lean IndisputableMonolith/Foundation/UniversalForcing/StrictRealization.lean
expected axiom basis: [propext, Classical.choice, Quot.sound] (the Lean kernel's standard three; no RS-specific axioms)

A page whose claims cannot be reproduced this way does not ship. In production, every anchor links to the exact declaration in the public source release, and this block carries the build receipt for the page itself.

Derived articles

This page is generated by a question-recursion engine: the questions its answers raise become the next pages. The current agenda, with open targets marked red: