author nipkow Thu, 30 Nov 2000 16:48:38 +0100 changeset 10545 216388848786 parent 10544 71eb53f36878 child 10546 b0ad1ed24cf6
*** empty log message ***
--- a/doc-src/TutorialI/Advanced/WFrec.thy	Thu Nov 30 14:10:23 2000 +0100
+++ b/doc-src/TutorialI/Advanced/WFrec.thy	Thu Nov 30 16:48:38 2000 +0100
@@ -23,9 +23,8 @@
In general, \isacommand{recdef} supports termination proofs based on
arbitrary well-founded relations as introduced in \S\ref{sec:Well-founded}.
This is called \textbf{well-founded
-recursion}\indexbold{recursion!well-founded}\index{well-founded
-recursion|see{recursion, well-founded}}. Clearly, a function definition is
-total iff the set of all pairs $(r,l)$, where $l$ is the argument on the
+recursion}\indexbold{recursion!well-founded}. Clearly, a function definition
+is total iff the set of all pairs $(r,l)$, where $l$ is the argument on the
left-hand side of an equation and $r$ the argument of some recursive call on
the corresponding right-hand side, induces a well-founded relation.  For a
systematic account of termination proofs via well-founded relations see, for