Computability / CONCEPT
Original guarded UNSAT and the ordered UNSAT-SAT pair
Conditional completeness of the exact original guarded languages.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES0
PROOF DEPTH12
DOCUMENT LINKS0
One original SAT premise
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A finite lexical repair transducerstructural-affinity · Closed
- Both tape decisions in a stack framestructural-affinity · Closed
- NP preimages with exact target witness boundsstructural-affinity · Closed
- Polynomial pairing from one common inputstructural-affinity · Closed
- Polynomial preprocessing before a total verifierstructural-affinity · Closed
- The ordered original guarded pair languagestructural-affinity · Closed
- Total exact binary pair projectionsstructural-affinity · Closed
- Total normalization of bounded verifiersstructural-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