c6_falsifier
plain-language theorem explainer
The declaration asserts that the falsifier class for the C6 Erikson Reverse combination equals the ADNI dementia progression test class. Researchers validating the empirical testability of Recognition Science cross-domain theorems would reference this mapping. The proof reduces to reflexivity on the definition of the falsifier class function.
Claim. The empirical test class assigned to the C6 Erikson Reverse combination is the ADNI dementia progression test class: $falsifierClass(C6 Erikson Reverse) = ADNI Dementia Progression$.
background
The Option A Falsifier Registry maintains a finite mapping from each of the nine C1-C9 cross-domain theorems to a specific empirical test class. This registry ensures that the theorems remain attached to concrete falsifiable predictions rather than drifting into unfalsifiable claims. The function falsifierClass defines this mapping, sending each CombinationID to its corresponding TestClass such as C1 Cognitive Tensor to EEG decoder.
proof idea
The proof is a direct reflexivity step: the equality holds immediately by the definition of falsifierClass, which includes the explicit case mapping .c6EriksonReverse to .adniDementiaProgression.
why it matters
This theorem populates the falsifier registry certificate, which records the counts of combinations, test classes, and related structures. It contributes to the framework's emphasis on empirical testability for the Option A cross-domain results, preventing numerological interpretations. The registry supports the broader Recognition Science goal of deriving physics from a functional equation while maintaining falsifiability.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.