
diff -r 71b2a1fefb84 -r 3dc292be0b54 doc-src/TutorialI/Sets/sets.tex
--- a/doc-src/TutorialI/Sets/sets.tex	Fri Nov 02 08:26:01 2007 +0100
+++ b/doc-src/TutorialI/Sets/sets.tex	Fri Nov 02 08:59:15 2007 +0100
@@ -874,12 +874,12 @@
 \label{sec:Well-founded}
 
 \index{relations!well-founded|(}%
-A well-founded relation captures the notion of a terminating process. 
-Complex recursive functions definitions \ref{sec:?????TN}
-must specify a well-founded relation that
-justifies their termination.  Most of the
-forms of induction found in mathematics are merely special cases of
-induction over a well-founded relation.
+A well-founded relation captures the notion of a terminating
+process. Complex recursive functions definitions must specify a
+well-founded relation that justifies their termination
+({\S}\ref{sec:beyond-measure}).  Most of the forms of induction found
+in mathematics are merely special cases of induction over a
+well-founded relation.
 
 Intuitively, the relation~$\prec$ is \textbf{well-founded} if it admits no
 infinite  descending chains




