Computability / CONCEPT
Unrestricted Original Clause Words
The original binary-name CNF encoding has an unrestricted total decoder and a fixed finite parser with a linear transition bound.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH1
DOCUMENT LINKS0
Exact unrestricted decoding and malformed rejection
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
- Binary Name Dictionary Constructionstructural-affinity · Closed
- Binary Name Dictionary Lookupstructural-affinity · Closed
- Conventional Appearing Name Clause Wordsstructural-affinity · Closed
- Exact original guarded clause languagesstructural-affinity · Closed
- Exact total ordered pair decodingstructural-affinity · Closed
- The ordered original guarded pair languagestructural-affinity · Closed
- Total exact binary pair projectionsstructural-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