Rewriting / CONCEPT
Unrestricted finite unification completeness
Unrestricted finite unification completeness.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH3
DOCUMENT LINKS0
A common solution prevents single-equation failure
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
- All native ground solutions and constraint pullbackstructural-affinity · Closed
- Delayed leaf certificates for arbitrary templatesstructural-affinity · Closed
- Exact native terms and finite presentationsstructural-affinity · Closed
- Native fragment preservation by the original algorithmstructural-affinity · Closed
- Native substitution closurestructural-affinity · Closed
- NativeWholeRowPlanstructural-affinity · Closed
- UnificationFuelstructural-affinity · Closed
- UniformNativeUnificationDomainstructural-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