--- a/rdf-mt/index.html	Wed Jun 19 12:22:34 2013 -0500
+++ b/rdf-mt/index.html	Wed Jun 19 12:29:10 2013 -0500
@@ -418,10 +418,11 @@
 
 <section id="simpleentailment"><h2>Simple Entailment</h2>
 
-<p>Following standard terminology, we say that I <dfn>satisfies</dfn> E when I(E)=true, that E is <dfn>satisfiable</dfn> when an interpretation exists which satisfies it, (otherwise <dfn>unsatisfiable</dfn>), that a graph G <dfn>simply entails</dfn> a graph E when every interpretation which satisfies G also satisfies E. If S is a set of graphs then S simply entails E when the <a>unionizing</a> of S simply entails E. In later sections these notions will be adapted to other classes of interpretations, but throughout this section 'entailment' should be interpreted as meaning simple entailment.
+<p>Following standard terminology, we say that I <dfn>satisfies</dfn> E when I(E)=true, that E is <dfn>satisfiable</dfn> when an interpretation exists which satisfies it, (otherwise <dfn>unsatisfiable</dfn>), that a graph G <dfn>simply entails</dfn> a graph E when every interpretation which satisfies G also satisfies E. If S is a set of graphs then S simply entails E when any every interpretation which satisfies every member of the <a>unionizing</a> of S also satisfies E. </p>
+<p>In later sections these notions will be adapted to other classes of interpretations, but throughout this section 'entailment' should be interpreted as meaning simple entailment.
 </p>
 
-<p class="changenote">This definition treats a set of graphs identically to its union, unlike the definition used in the 2004 RDF 1.0 Semantics. This is more appropriate for the case where graphs may share blank nodes, as can occur with the graphs in an RDF dataset. If this case does not arise, this definition is exactly equivalent to the previous definition.</p>
+<p class="changenote">This definition treats a set of graphs which share blank nodes identically to its union, unlike the definition used in the 2004 RDF 1.0 Semantics. This is more appropriate for the case where graphs may share blank nodes, as can occur with the graphs in an RDF dataset. If this case does not arise, this definition is identical to the previous definition.</p>
 
     <p><a id="defvalid">Any process which constructs a graph E from
     some other graph(s) S is (simply) <dfn>valid</dfn> if S