Computability / CONCEPT
A finite lexical repair transducer
A finite lexical repair transducer.
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES1
PROOF DEPTH7
DOCUMENT LINKS0
exec_scan
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
- Checking the original target certificate boundstructural-affinity · Closed
- Composition of polynomial many-one reductionsstructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Exact original guarded clause languagesstructural-affinity · Closed
- Exact total ordered pair decodingstructural-affinity · Closed
- NP preimages with exact target witness boundsstructural-affinity · Closed
- Original guarded UNSAT and the ordered UNSAT-SAT pairstructural-affinity · Closed
- Original native binary word acquisitionstructural-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
- Unrestricted Original Clause Wordsstructural-affinity · Closed
- Whole stack programs as polynomial tape machinesstructural-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