[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. 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
,
Theorem cyclic-def
⊦ cyclic(r, H) ↔ (∃ m, n, r0. m < n ∧ reachable-n(H, m, r, r0) ∧ reachable-n(H, n, r, r0))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
cyclic-alt-def
,
cyclic-brent-def
,
cyclic-floyd-def
,
path-dups
,
Used by units in proved state:
challenge4
,
Proof exists?: No