ConceptDynamics / CONCEPT
Prescribed finite arrays and ordered labels
Prescribed finite arrays and ordered labels. All numbered edges, ordered labels and source conditions are retained.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
Ordered total-label preservation
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 ordered factor paths and reversible peelingstructural-affinity · Closed
- Complete original long compatibility equationsstructural-affinity · Closed
- Complete records and reversible fixed cutsstructural-affinity · Closed
- Counted group chain recovery windowsstructural-affinity · Closed
- Counted group-labelled overlap codesstructural-affinity · Closed
- Equivariant roots on actual primitive liftsstructural-affinity · Closed
- Exact triangle recovery in the prescribed arraystructural-affinity · Closed
- Ordered group chain historiesstructural-affinity · Closed
- The involution factorization as an exact exchangestructural-affinity · Closed
- Twisted periods from finite seamed 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