ConceptDynamics / CONCEPT
Dependency Reachability Order
Acyclic dependency reachability is a partial order.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES9
PROOF DEPTH0
DOCUMENT LINKS1
Acyclic reachability has the three partial-order laws
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
- Alexandrov Dependency Topologytruth-dependency · Closed
- Axiom Closure Monotonicitytruth-dependency · Closed
- Consequence Closuretruth-dependency · Closed
- Finite Acyclic Judging Graph Roottruth-dependency · Closed
- Prerequisite Closuretruth-dependency · Closed
- Proof Topology Coretruth-dependency · Closed
- Reachability Projection Invariancetruth-dependency · Closed
- Reachability-Conservative Embeddingtruth-dependency · Closed
- Strong Component Quotienttruth-dependency · Closed
RELATED KNOWLEDGE
Structural connections
- Alexandrov Dependency Topologystructural-affinity · Closed
- Axiom Closure Monotonicitystructural-affinity · Closed
- Consequence Closurestructural-affinity · Closed
- Dominator Cutstructural-affinity · Closed
- Finite Acyclic Judging Graph Rootstructural-affinity · Closed
- Prerequisite Closurestructural-affinity · Closed
- Proof Topology Corestructural-affinity · Closed
- Reachability Projection Invariancestructural-affinity · Closed
- Reachability-Conservative Embeddingstructural-affinity · Closed
- Strong Component Quotientstructural-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