ConceptDynamics / CONCEPT
Running Intersection Messages
Recursive separator messages characterize nonemptiness of the raw join on a finite running-intersection tree.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS1
Root acceptance characterizes the raw join
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
- Boundary Observation Splicingstructural-affinity · Closed
- Capacity-sensitive supports and common extensionsstructural-affinity · Closed
- Common Extensions on Finite Treesstructural-affinity · Closed
- Executable capacity-sensitive tree gluingstructural-affinity · Closed
- Finite running-intersection computationstructural-affinity · Closed
- History Payload Factorizationstructural-affinity · Closed
- Running Intersection Necessitystructural-affinity · Closed
- Running Intersection Recordsstructural-affinity · Closed
- Split Surjection Factorizationstructural-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