[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,

Lemma dependency for Specification Meyden4VarsTrans

A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.

Name: Status: Subs proved? Used:
LanguageBasedNIF-runprovedall subs proved eqd-run-lemma,
Security-simpleprovedall subs proved lemma1,
Securityprovedall subs proved lemma1,
eqd-run-lemmaprovedall subs proved eqd-symmetry, eqd-transitivity, eqd-reflexivity, lemma1-gen,
lemma1provedall subs proved eqd-reflexivity, lemma1-gen, run-initial,
Security-without-initialstateprovedall subs proved eqd-symmetry, eqd-transitivity, eqd-reflexivity, lemma1-gen,
Security-simple-without-initialstateprovedall subs proved eqd-reflexivity, lemma1-gen,
lemma1-genprovedall subs proved step1-eqd, step-eqd, purge-rec, run-rec, purge-base, run-base,
purge-idempotentprovedall subs proved purge-rec, purge-base,
run-baseaxiom
purge-baseaxiom
run-recaxiom
purge-recaxiom
step-eqdprovedall subs proved
step1-eqdprovedall subs proved
run-initialaxiom
eqd-reflexivityprovedall subs proved
eqd-transitivityprovedall subs proved
eqd-symmetryprovedall subs proved