Arith / CONCEPT
Literal installation and actual Read lower bounds
CombLiteralInstallationBounds
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES1
PROOF DEPTH17
DOCUMENT LINKS0
Every successful run reads every original leaf
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
- Complete static native parity scanstructural-affinity · Closed
- Effective Original Source Acquisitionstructural-affinity · Closed
- Executable Numeric Selectorstructural-affinity · Closed
- Expanded active parity executionstructural-affinity · Closed
- Finite Families of Integer Trace Relationsstructural-affinity · Closed
- Fixed skeleton query separationstructural-affinity · Closed
- Native Full Source Productionstructural-affinity · Closed
- Native Tree Obstruction for Polynomial Trace Familiesstructural-affinity · Closed
- NativeControlConjugacystructural-affinity · Closed
- NativeFibonacciActiveTablestructural-affinity · Closed
- NativeSerialMachinestructural-affinity · Closed
- The Fibonacci Count of Zeckendorf-Admissible Wordsstructural-affinity · Closed
- The Ordered Fibonacci Source Centralizerstructural-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