Arith / CONCEPT
Recursive decomposition of unrestricted native image languages
NativeImageSaturationInterface
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH23
DOCUMENT LINKS0
Actual native images split into bounded terminals and recursive pairs
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
- Arbitrary free values have a unique guarded native extensionstructural-affinity · Closed
- Bounded atomic terminals survive simultaneous free-value replacementstructural-affinity · Closed
- Canonical coding of the native completionstructural-affinity · Closed
- Effective prefixes of canonical native solutionsstructural-affinity · Closed
- Exact positive-drift completed region splitstructural-affinity · Closed
- Exhaustive completed homogeneous fixed-point splitstructural-affinity · Closed
- Free native states resist countable parameterizationstructural-affinity · Closed
- Joint actual-image saturation for guarded native systemsstructural-affinity · Closed
- Original prefixes from finite native image datastructural-affinity · Closed
- Rank-free obstruction for native functional systemsstructural-affinity · Closed
- Root-link normalization on the unrestricted native completionstructural-affinity · Closed
- Signed native support and exact product closurestructural-affinity · Closed
- Symbolic finite coordinates of native joint solutionsstructural-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