[Imprint][Data Privacy Statement][E-Mail]
Back to main index.
View the specification.
View theorem base summary,
View theorem base listing,
the used properties by spec,
the dependency list,
the symbol table,
enrich
infgraph-gen,
infinite-append
with
functions ls : graph → elem × elem → bool;
predicates findepth : graph;
treep : graph;
nocycle : graph;
rooted : graph;
variables g : graph;
x : list;
y : list;
axioms nocycle-def : ⊦ nocycle(g) ↔ (∀ a, y. ¬ pathp(g)(⌜a '⌝ + ⌜y⌝ + ⌜a '⌝ ));
findepth-def : ⊦ findepth(g) ↔ (∀ σ. pathp(g)(σ) → # σ ≠ ∞);
rooted-def : ⊦ rooted(g) ↔ (∃ a. isroot(g)(a) ∧ (∀ b. path(g)(a, b)));
treep-def : ⊦ treep(g) ↔ rooted(g) ∧ nocycle(g);
order-def : ⊦ ls(g)(a, b) ↔ (∃ y. pathp(g)(⌜b '⌝ + ⌜y⌝ + ⌜a '⌝ ));
end enrich