History / CONCEPT
Source Tree Representation
Free binary source trees have precisely the independently generated tagged HF codes.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS1
Every legal source code reconstructs a tree
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
- Arithmetic and Order on Integer HF Codesstructural-affinity · Closed
- Canonical Integer Representativesstructural-affinity · Closed
- Complement and Background Chargestructural-affinity · Closed
- Coordinate and Attribute Tuplesstructural-affinity · Closed
- Finite Graph Reconstructionstructural-affinity · Closed
- Finite Spacetime Archivesstructural-affinity · Closed
- Hereditary Finite Event Codesstructural-affinity · Closed
- Integer HF Codesstructural-affinity · Closed
- Nodes of a finite binary graphstructural-affinity · Closed
- Relative Complementstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance