g1 
g2 == 
ga,gb:LabeledGraph(T). (g2 = lg-append(ga;lg-append(g1;gb)))
Definitions :
exists: x:A. B[x],
equal: s = t,
labeled-graph: LabeledGraph(T),
lg-append: lg-append(g1;g2)
FDL editor aliases :
lg-contains
g1 \msubseteq{} g2 == \mexists{}ga,gb:LabeledGraph(T). (g2 = lg-append(ga;lg-append(g1;gb)))
Date html generated:
2010_08_27-PM-03_39_41
Last ObjectModification:
2010_06_02-PM-02_32_02
Home
Index