Certificates / CONCEPT
LRAT Certificates for Sparse DFAO State Lower Bounds
A kernel-checked LRAT refutation of any certified finite-prefix encoding rules out every globally correct DFAO within the same state budget.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS1
Finite-prefix refutation gives a global bounded-state exclusion
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Arithmetic Inputs in the Base Languagestructural-affinity · Closed
- Certified CNF Semantics for DFA Identificationstructural-affinity · Closed
- Golden-Ratio DFAO Minimality Targetsstructural-affinity · Closed
- Labeled Prefix Occurrencesstructural-affinity · Closed
- LRAT Refutations and Unsatisfiabilitystructural-affinity · Closed
- Multiplication on Infinite Legal Digit Streamsstructural-affinity · Closed
- The Exact Binary Base Languagestructural-affinity · Closed
- Typed DFAO Identification Coloringsstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance