ConceptDynamics / CONCEPT
Finite Acyclic Judging Graph Root
A finite nonempty acyclic judging graph has a vertex with no incoming judge.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH4
DOCUMENT LINKS1
A finite acyclic judging graph has a root
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
- Consequence Closurestructural-affinity · Closed
- Dependency Reachability Orderstructural-affinity · Closed
- Executable Frontierstructural-affinity · Closed
- Finite Ready Existencestructural-affinity · Closed
- Frontier Antichainstructural-affinity · Closed
- Frontier Extension Closurestructural-affinity · Closed
- Reachability Projection Invariancestructural-affinity · Closed
- Reachability-Conservative Embeddingstructural-affinity · Closed
- Strong Component Quotientstructural-affinity · Closed
- Well-Founded Frontierstructural-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