Words / CONCEPT
The literal zero-digit rule for every Fibonacci palindrome
The literal zero-digit rule for every Fibonacci palindrome
Closed
DIRECT PREREQUISITES4
DIRECT CONSEQUENCES0
PROOF DEPTH17
DOCUMENT LINKS1
frid_canonical_necessity
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A complete box for signed Fibonacci carriesstructural-affinity · Closed
- Actual finite partial machinesstructural-affinity · Closed
- Arithmetic Inputs in the Base Languagestructural-affinity · Closed
- Bounded complete residual representativesstructural-affinity · Closed
- Canonical Input Transport for the Golden Base-Four Machinestructural-affinity · Closed
- Legal residual normal formsstructural-affinity · Closed
- Moradi--Rampersad--Shallit Problem 1: exact partial MSD modelstructural-affinity · Closed
- Palindrome reflection forces the paired endpoint languagestructural-affinity · Closed
- The exact palindromic length of every Frid prefixstructural-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