Computability / CONCEPT
Exact total ordered pair decoding
Exact total ordered pair decoding.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES4
PROOF DEPTH5
DOCUMENT LINKS0
decodePair_eq_some_iff
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
- An executed ordered pair constructorstructural-affinity · Closed
- Checking the original target certificate boundstructural-affinity · Closed
- Complexity classes in one concrete machine modelstructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Exact original guarded clause languagesstructural-affinity · Closed
- Natural sequences as legal infinite digitsstructural-affinity · Closed
- Primitive unary-prefix parsingstructural-affinity · Closed
- Unary outer-length prefixesstructural-affinity · Closed
- Uniform numerical clocks and output boundsstructural-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