ConceptDynamics / CONCEPT
Bounded Runs and Coherent Prefixes
Run restrictions, finite words, and coherent prefixes share one Boolean coordinate alphabet.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES2
PROOF DEPTH6
DOCUMENT LINKS2
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
- Centered Reduced Residue Progressionsstructural-affinity · Closed
- CounterexampleRecordstructural-affinity · Closed
- Finite Exhaustion and the Bounded-Run Unionstructural-affinity · Closed
- GuardedEqualityRegistrationTemplatesstructural-affinity · Closed
- Infinite Identification without Finite Exact Tomographystructural-affinity · Closed
- Mathar's recurrence for surviving walks from height 3structural-affinity · Closed
- Mutual Abelian-Border Densities of Binary Word Pairsstructural-affinity · Closed
- Registration Template and Helpersstructural-affinity · Closed
- Statistical Mechanics: Walk Countstructural-affinity · Closed
- Wu's Pyramidal Complement Formulastructural-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