[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 isPersistFO
⊦ isPersistFO(n, fowl) ↔ n < # fowl ∧ fowl[n].FO? ∧ (∀ m. m < n → fowl[m].tid ≠ fowl[n].tid ∧ fowl[m].FO?)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
isPersistFO-del-no-W-stable
,
isPersistFO-leading-W
,
isPersistFO-rec
,
one-pending-del-persist-FO-no-pending
,
rely-persist-FO-weak
,
Used by units in proved state:
abs-FLIT-FLITPSCweak
,
FLITPSCweak-refines-PLIB
,
Proof exists?: No