--- a/rdf-mt/index.html	Fri Dec 20 13:13:12 2013 +0000
+++ b/rdf-mt/index.html	Sat Dec 21 23:41:29 2013 -0800
@@ -543,7 +543,7 @@
 
 
 
-<p class="changenote">  In the 2004 RDF 1.0 specification, ill-typed literals were required to denote a value in IR, and D-inconsistency could only be recognized by using the RDFS semantics. </p>
+<p class="changenote">  In the 2004 RDF 1.0 specification, ill-typed literals were required to denote a value in IR, and <a title="D-unsatisfiable">D-unsatisfiability</a> could be recognized only by using the RDFS semantics. </p>
 
 
 </section>
@@ -556,7 +556,7 @@
 
 <p> A <a>D-unsatisfiable</a> graph D-entails any graph.</p>
 
-<p class="technote">The fact that an unsatisfiable statement entails any other statement has been known since antiquity. It is called the principle of <em>ex falso quodlibet</em>. It should not be interpreted to mean that it is necessary, or even permissible, to actually draw any conclusion from an inconsistency.</p>
+<p class="technote">The fact that an unsatisfiable statement entails any other statement has been known since antiquity. It is called the principle of <em>ex falso quodlibet</em>. It should not be interpreted to mean that it is necessary, or even permissible, to actually draw any conclusion from an unsatisfiable graph.</p>
 
 <p>In all of this language, 'D' is being used as a parameter to represent some set of datatype IRIs, and different D sets will yield different notions of satisfiability and entailment. The more datatypes are <a>recognize</a>d, the stronger is the entailment, so that if D &subset; E and S E-entails G then S must D-entail G. Simple entailment is {&nbsp;}-entailment, i.e. D-entailment when D is the empty set, so if S D-entails G  then S simply entails G. </p>
 
@@ -581,13 +581,13 @@
 
 <p>(There is a W3C Note [[SWBP-XSCH-DATATYPES]] containing a long <a href="http://www.w3.org/TR/swbp-xsch-datatypes/#sec-values">discussion</a> of literal values.)</p>
 
-<p><a>ill-typed</a> literals are the only way in which a graph can be simply <a>D-unsatisfiable</a>, but datatypes can give rise to a variety of other unsatisfiable graphs when combined with the RDFS vocabulary, defined later.</p>
+<p><a>Ill-typed</a> literals are the only way in which a graph can be simply <a>D-unsatisfiable</a>, but datatypes can give rise to a variety of other unsatisfiable graphs when combined with the RDFS vocabulary, defined later.</p>
 </section>
 
 </section>
 </section>
 <section><h2 id="rdf_d_interpretations">RDF Interpretations</h2>
-    <p >RDF interpretations impose extra semantic conditions on <code>xsd:string</code> and part of the infinite
+    <p>RDF interpretations impose extra semantic conditions on <code>xsd:string</code> and part of the infinite
   set of IRIs with the namespace prefix <code>rdf:</code> .
 
 <div >
@@ -1541,6 +1541,7 @@
       <h2 id="ChangeLog">Change Log (informative)</h2>
 <p>Changes since Candidate Recommendation:</p>
 <ul>
+<li> Minor typos corrected. Some text added to section 7 defining datatype maps.</li>
 <li> This part of the change log was added. </li>
 </ul>