ObserverMemory / CONCEPT
Naive Refinement Complexity
Finite signature refinement has linear rounds and the stated sorting and hashing costs.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH4
DOCUMENT LINKS1
Canonical refinement has the finite-system complexity bounds
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
- Controlled Distinguishing Depthstructural-affinity · Closed
- Controlled Finite Stabilitystructural-affinity · Closed
- Controlled Relation Recursionstructural-affinity · Closed
- Finite Future Congruencestructural-affinity · Closed
- Knaster–Tarski Witnessstructural-affinity · Closed
- Maximal Forward-Invariant Subkernelstructural-affinity · Closed
- Recursive Definitions as Selected Fixed Pointsstructural-affinity · Closed
- Three-Cycle Fixed-Point Gapstructural-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