Delta Kernel Ledger Of Em Ne Empty

The posit ledger

The law of excluded middle, the principle that every statement is either true or false, is a classical logical assumption. In the Recognition Science framework's machine-checked library of formal theorems, a derivation that invokes this principle is recorded as consuming a named posit. The declaration ledger, a discrete record of which assumptions a derivation used, has a field for this posit, and the theorem ofEM_ne_empty proves that a ledger containing the excluded-middle posit is not the empty ledger.

The empty ledger is the record of a derivation that consumed no posits at all. The framework calls such a derivation forced: it rests only on the kernel's base rules, with no classical or omniscience principles assumed. The theorem ofEM_ne_empty establishes, in plain terms, that a derivation which uses the law of excluded middle cannot be counted as forced. It is a structural fact about the ledger, proved by deciding the Boolean fields, not a claim about any particular mathematical statement.

The ledger also tracks the limited principle of omniscience and Markov's principle as separate posits, and carries a tier flag for whether induction was used on a formula with quantifiers. The framework treats whether full induction is itself forced as a measured question, not a pre-judged one. The theorem ofEM_ne_empty does not address that question: it only confirms that the excluded-middle posit is distinct from the empty record.

theorem ofEM_ne_empty : ofEM ≠ empty := by decide

@[simp] theorem empty_isForced : empty.isForced = true := rfl

@[simp] theorem ofEM_isForced : ofEM.isForced = false := rfl

What this page does not claim

The theorem does not say that any particular statement is undecidable or that excluded middle is invalid. It does not establish whether full induction is forced or a graded strength step. It does not claim that the empty ledger is the only forced derivation, only that this one posit makes a derivation conditional.

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/DeltaKernel/Ledger.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: