[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
with
functions reach : graph → set × nat → elem → bool;
reach≤ : graph → set × nat → elem → bool;
. ^ . : (list → list) × nat → list → list;
haspathanylength : graph → elem → bool;
predicates finout : graph;
finroot : graph;
allreachable : graph;
infgraph : graph;
variables eP : elem → bool;
cf : list → list;
rf : set × nat → elem → bool;
x : list;
s : set;
axioms it-zero : ⊦ ((cf ^ 0))(x) = x;
it-succ : ⊦ ((cf ^ (n + 1)))(x) = cf(((cf ^ n))(x));
infgraph-def : ⊦ infgraph(g) ↔ (∀ s. ∃ a. dom(g)(a) ∧ ¬ a ∈ s);
used for: ls;
finroot-def : ⊦ finroot(g) ↔ (∃ s. ∀ a. isroot(g)(a) ↔ a ∈ s);
used for: ls;
finout-def : ⊦ finout(g) ↔ (∀ a. ∃ s. ∀ b. edge(g)(a, b) ↔ b ∈ s);
used for: ls;
allreachable-def : ⊦ allreachable(g) ↔ (∀ b. dom(g)(b) → (∃ a. isroot(g)(a) ∧ path(g)(a, b)));
used for: ls;
reach-def : ⊦ reach(g)(s, n)(b) ↔ (∃ x. x ≠ [] ∧ x.head ∈ s ∧ pathp(g)(⌜x⌝ ) ∧ b = x.last ∧ # x = n + 1);
used for: ls;
reachle-def : ⊦ reach≤(g)(s, n)(b) ↔ (∃ m. m ≤ n ∧ reach(g)(s, m)(b));
haspathanylength-def : ⊦ haspathanylength(g)(a) ↔ (∀ n. ∃ x. x.head = a ∧ # x = n + 1 ∧ pathp(g)(⌜x⌝ ));
end enrich