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

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:
RED-iff-reduceprovedall subs proved RED-complete, RED-correct,
RED-completeprovedall subs proved RED1-lem, decl-03,
RED-correctprovedall subs proved kappa-RED1, RED1-lem, decl-03,
kappa-RED1provedall subs proved decl-04, kappa-TOPRED, decl-01,
RED1-lemprovedall subs proved TOPRED-lem, decl-01,
ks-REDprovedall subs proved ks-RED1, decl-04, decl-01, decl-03,
termination-REDprovedall subs proved termination-RED1, decl-03,
TOPRED-lemprovedall subs proved decl-04,
kappa-TOPREDprovedall subs proved decl-04,
ks-RED1provedall subs proved decl-04, decl-01,
termination-RED1provedall subs proved decl-04, decl-01,
termination-TOPREDprovedall subs proved decl-04,
ks-TOPREDprovedall subs proved decl-04,
SII-loopsprovedall subs proved decl-04, decl-01, decl-03, I-def, SII-def,
SII-defaxiom
I-defaxiom
decl-04axiom
decl-01axiom
decl-03axiom