ConceptDynamics / CONCEPT
Endpoint-typed finite positive words with explicit corrections
Endpoint-typed finite positive words with explicit corrections.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH8
DOCUMENT LINKS0
eval_time
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 beam images in the native right-row colimitstructural-affinity · Closed
- Actual-history charts, endpoint-corrected positive-word gyration and signed time translationstructural-affinity · Closed
- Construct the positive word on the original finite presentationstructural-affinity · Closed
- Count the signed corrections of every actual split towerstructural-affinity · Closed
- Dependent positive words transport actual beam coordinatesstructural-affinity · Closed
- Derive integer-time laws inside the actual recoding constructionsstructural-affinity · Closed
- Exact numbered positive recoding and inverse time signsstructural-affinity · Closed
- Finite graph relabels preserve actual beam coordinatesstructural-affinity · Closed
- Number the actual incoming split and retain its time correctionstructural-affinity · Closed
- Profiles of the towers actually constructed by reductionstructural-affinity · Closed
- Relabel actual graph histories by vertex and edge equivalencesstructural-affinity · Closed
- Transport forward orbit phases under timed history equivalencesstructural-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