[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 RGn-Decomp-Partial

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:
spawn-sat-rg	proved	all subs proved	prton-def, spawn-sat-rg-strnger,
spawn-partial-corr-strng	proved	all subs proved	prton-def, spawn-sat-rg-strnger,
spawn-sat-rg-strnger	proved	all subs proved	rg-restr2, rg-restr1, gto-def, poton-def, rton-def, prton-def, seq-sat-rg,
rg-restr1	proved	all subs proved	poton-def, gto-def, rton-def,
rg-restr2	proved	all subs proved	poton-def, prton-def, gto-def, rton-def,
seq-sat-rg	proved	all subs proved
prton-def	axiom
rton-def	axiom
gto-def	axiom
poton-def	axiom