Combinatorics / CONCEPT
Pure Stack Histories
Record and descent steps act on Boolean stacks, with record gaps recording expenditure.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES3
PROOF DEPTH0
DOCUMENT LINKS1
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Decomposition at the First Recordstructural-affinity · Closed
- Enumeration of Original Piecesstructural-affinity · Closed
- Finiteness of Full Historiesstructural-affinity · Closed
- Finiteness of Pure Historiesstructural-affinity · Closed
- Pure Histories and Original Piecesstructural-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