ConceptDynamics / CONCEPT
Protocol and Relation Closure Laws
The canonical protocol and relation closures satisfy all three closure laws.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH7
DOCUMENT LINKS1
Both canonical closures are extensive, monotone, and idempotent
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
- Definition Closure as an Upstream Closure Operatorstructural-affinity · Closed
- Definition Kernel Galoisstructural-affinity · Closed
- Multi-Target Blind Residualstructural-affinity · Closed
- Observation Closure Lawsstructural-affinity · Closed
- Observation Kernels as Formal-Concept Extentsstructural-affinity · Closed
- Semantic Closure Strict Novelty Criterionstructural-affinity · Closed
- Semantic Closure Zero-Gain Criterionstructural-affinity · Closed
- Source Closure Three Lawsstructural-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