Computability / CONCEPT
The ordered original guarded pair language
All raw outer words have an exact guarded intersection characterization.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH11
DOCUMENT LINKS0
UNSAT is first and SAT is second
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
- A finite lexical repair transducerstructural-affinity · Closed
- Exact original guarded clause languagesstructural-affinity · Closed
- NP preimages with exact target witness boundsstructural-affinity · Closed
- Original guarded UNSAT and the ordered UNSAT-SAT pairstructural-affinity · Closed
- Polynomial preprocessing before a total verifierstructural-affinity · Closed
- Preserving witnesses under polynomial instance mapsstructural-affinity · Closed
- Total exact binary pair projectionsstructural-affinity · Closed
- Total normalization of bounded verifiersstructural-affinity · Closed
- Unrestricted Original Clause Wordsstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance