Combinatorics / CONCEPT
Finiteness of Full Histories
A fixed initial state has finitely many full histories of any prescribed length.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS1
Finite full-history classes
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
- Decomposition at the First Recordstructural-affinity · Closed
- Endpoints of Pure Historiesstructural-affinity · Closed
- Enumeration of Original Piecesstructural-affinity · Closed
- Finiteness of Pure Historiesstructural-affinity · Closed
- Grouped Renewal Seriesstructural-affinity · Closed
- Pure Histories and Original Piecesstructural-affinity · Closed
- Pure Stack Historiesstructural-affinity · Closed
- Renewal at the First Old Sitestructural-affinity · Closed
- The Bivariate Pure-History Seriesstructural-affinity · Closed
- Weighted Renewal Countsstructural-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