--- a/rdf-mt/index.html	Mon Apr 01 15:54:25 2013 +0200
+++ b/rdf-mt/index.html	Mon Apr 01 16:07:46 2013 +0200
@@ -180,7 +180,7 @@
   and if H is an instance of G then every triple in H is an instance of at least one triple 
   in G.</p>
 <p>An <dfn>instance with respect to</dfn> a vocabulary 
-  V </a>is an <a>instance</a> in which all the 
+  V is an <a>instance</a> in which all the 
   <a>name</a>s in the instance that were substituted 
   for blank nodes in the original are <a>name</a>s 
   from V.</p>
@@ -209,7 +209,7 @@
 
 <p >An RDF graph is <dfn>lean</dfn> if it has no instance which is 
   a proper subgraph of the graph. Non-lean graphs have internal redundancy 
-  and express the same content as their lean subgraphs. For example, the graph</span></p>
+  and express the same content as their lean subgraphs. For example, the graph</p>
 <p ><code>&lt;ex:a&gt; &lt;ex:p&gt; _:x .<br/>
   _:y &lt;ex:p&gt; _:x .</code></p>
 <p >is not lean, but</p>
@@ -229,7 +229,7 @@
 <p>A <dfn>simple interpretation</dfn> I is a structure consisting of:</p>
 
 <div class="tabletitle">Definition of a simple interpretation.</div>
-<table border="1" summary="definition of a simple interpretation">
+<table border="1">
   <tr>
         <td class="semantictable"><p>1. A non-empty set IR of resources, called the domain or universe
             of I.</p>
@@ -265,7 +265,7 @@
 
 
   <div class="tabletitle">Semantic conditions for ground graphs.</div>
-  <table cellpadding="5" border="2" summary="semantic conditions for RDF graphs">
+  <table border="2">
         <tbody>
 
 
@@ -280,7 +280,7 @@
           <tr>
         <td class="semantictable"><p>if E is a ground triple s p o<code>.</code> 
           then I(E) = true if </p>
-        <p>I(p) is in IP and the pair </span> &lt;I(s),I(o)&gt; 
+        <p>I(p) is in IP and the pair &lt;I(s),I(o)&gt; 
           is in IEXT(I(p))</p>
           <p>otherwise I(E)= false.</p></td>
           </tr>
@@ -307,7 +307,7 @@
 <p> Suppose I is an interpretation and A is a mapping from a set of blank nodes to the universe IR of I. Define the mapping [I+A] to be I on names, and A on blank nodes on the set: [I+A](x)=I(x) when x is a name and [I+A](x)=A(x) when x is a blank node; and extend this mapping to triples and RDF graphs using the rules given above for ground graphs. </p>
 
     <div  class="tabletitle">Semantic condition for blank nodes.</div>
-      <table cellpadding="5" border="2" summary="Semantic conditions for blank nodes">
+      <table border="2">
         <tbody>
           
 
@@ -338,7 +338,9 @@
   which satisfies every member of S also satisfies E. This means that it is always correct to infer E from S, even when one does not know what the names in the vocabulary actually mean. 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><a id="defvalid" name="defvalid">Any process which constructs a graph E from some other graph(s) S is said to be (simply) <dfn>valid</dfn> if S simply entails E in every case, otherwise <dfn>invalid.</dfn> </p>
+    <p><a id="defvalid">Any process which constructs a graph E from
+    some other graph(s) S is said to be (simply) <dfn>valid</dfn> if S
+    simply entails E in every case, otherwise <dfn>invalid.</dfn></a></p> 
 
 <p>The fact that an inference is valid should not be understood as meaning that the inference must be made, or that any process is obliged or required to make the inference; and similarly, the logical invalidity of some RDF transformation or process does not mean that the process is incorrect or prohibited. Nothing in this specification requires or prohibits any particular operations to be applied to RDF graphs. Entailment and validity are concerned solely with establishing the conditions on operations which guarantee the preservation of truth. While logically invalid processes, which do not follow valid entailments, are not prohibited, users should be aware that they may be at risk of introducing falsehoods and errors into otherwise correct RDF data. Nevertheless, particular uses of logically invalid processes may be justified and appropriate for data processing under circumstances where truth can be ensured by other means. </p>