Certificates / CONCEPT
LRAT Refutations and Unsatisfiability
Mathlib LRAT empty-clause proofs are exactly propositional unsatisfiability certificates.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES1
PROOF DEPTH0
DOCUMENT LINKS1
Empty-clause derivability is equivalent to unsatisfiability
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
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 Certificates for Sparse DFAO State Lower Boundsstructural-affinity · Closed
- Multiplication on Infinite Legal Digit Streamsstructural-affinity · Closed
- The Base-Four Golden-Ratio Automata Oraclestructural-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