Arith / CONCEPT
Exact scalar formulas for native tree equality
NativeRankedEqualityCompiler
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH18
DOCUMENT LINKS0
Native equality is a finite conjunction of offset equalities
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
- Actual infinite branches of native completion treesstructural-affinity · Closed
- Canonical coding of the native completionstructural-affinity · Closed
- Every missing-prefix actual obstructionstructural-affinity · Closed
- Exhaustive completed homogeneous fixed-point splitstructural-affinity · Closed
- Free native states resist countable parameterizationstructural-affinity · Closed
- Guarded rank-only navigation and recordsstructural-affinity · Closed
- Infinite completion prefixes and finite simultaneous separationstructural-affinity · Closed
- Native Birth-Vector Decoderstructural-affinity · Closed
- Native prefix identity reflectionstructural-affinity · Closed
- Signed native support and exact product closurestructural-affinity · Closed
- Simultaneous finite prefix separationstructural-affinity · Closed
- Uniform native residual realizationstructural-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