summary |
shortlog |
changelog |
graph |
tags |
bookmarks |
branches |
files |
changeset |
file |
latest |
revisions |
annotate |
diff |
comparison |
raw |
help

doc-src/TutorialI/Sets/sets.tex

changeset 10978 | 5eebea8f359f |

parent 10888 | f321d21b9a6b |

child 10983 | 59961d32b1ae |

--- a/doc-src/TutorialI/Sets/sets.tex Thu Jan 25 11:59:52 2001 +0100 +++ b/doc-src/TutorialI/Sets/sets.tex Thu Jan 25 15:31:31 2001 +0100 @@ -871,7 +871,7 @@ Many familiar induction principles are instances of this rule. For example, the predecessor relation on the natural numbers is well-founded; induction over it is mathematical induction. -The `tail of' relation on lists is well-founded; induction over +The ``tail of'' relation on lists is well-founded; induction over it is structural induction. Well-foundedness can be difficult to show. The various