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

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:
ks-Kprovedall subs proved ks-K-01, ks-rec, ks-zero,
ks-K-01provedall subs proved ks-K-02, ks-rec, ks-zero,
ks-not-Sprovedall subs proved hasS-S, hasS-A, ks-not-hasS,
ks-not-S-01provedall subs proved hasS-S, hasS-A, ks-not-hasS,
ks-not-S-02provedall subs proved ks-zero, ks-rec-01, ks-not-hasS,
ks-K-02provedall subs proved ks-rec, ks-zero,
ks-rec-01provedall subs proved ks-rec,
ks-not-hasSprovedall subs proved hasS-A, ks-rec, hasS-K, ks-zero,
hasS-Kaxiom
hasS-Aaxiom
hasS-Saxiom
ks-zeroaxiom
ks-recaxiom