ConceptDynamics / CONCEPT
Relabel actual graph histories by vertex and edge equivalences
Relabel actual graph histories by vertex and edge equivalences.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH5
DOCUMENT LINKS0
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
- Actual integer-cut rays and intrinsic finite beamsstructural-affinity · Closed
- Derive integer-time laws inside the actual recoding constructionsstructural-affinity · Closed
- Endpoint-typed finite positive words with explicit correctionsstructural-affinity · Closed
- Exact numbered positive recoding and inverse time signsstructural-affinity · Closed
- Finite two-sided state-splitting inductionstructural-affinity · Closed
- Full outgoing splits and legal wordsstructural-affinity · Closed
- Identify the full outgoing input with the numbered responsestructural-affinity · Closed
- Number rectangular edge fibers for the actual outgoing splitstructural-affinity · Closed
- Number the actual incoming split and retain its time correctionstructural-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