pith. sign in
module module high

IndisputableMonolith.Foundation.OptionAFalsifierRegistry

show as:
view Lean formalization →

This module registers the implemented Option A combinations C1-C9 with their test classes, dataset classes, predicted observables, and failure modes. Researchers auditing empirical coverage of Recognition Science predictions would cite it to verify that no formal Option A result lacks a falsifier protocol. It is a definition module consisting of enumerations and counts with no theorems.

claimRegistry of falsifiers for Option A: $C_i$ ($i=1$ to $9$) each mapped to a DatasetClass, PredictedObservable, and FailureMode, with CombinationID, EmpiricalStatus, and TestClass as supporting enumerations (C10 remains commentary).

background

The module sits in the Foundation layer and introduces the core enumerations needed to attach empirical protocols to Option A results. CombinationID labels each implemented combination; TestClass and DatasetClass categorize the required observations; EmpiricalStatus records implementation state; PredictedObservable names the measurable quantity; and FailureMode specifies the concrete disconfirmation condition. The module doc comment states that C10 was left as commentary. No upstream lemmas are imported.

proof idea

this is a definition module, no proofs

why it matters in Recognition Science

The registry supplies the concrete mappings consumed by the OptionAEmpiricalProtocol module. That protocol converts the registry into a Lean proposition asserting total coverage: every implemented C1-C9 combination possesses a dataset class, predicted observable, and failure mode. It thereby closes the empirical-metadata requirement for the Option A branch of the Recognition framework.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

declarations in this module (35)