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

doc-src/Inductive/ind-defs.tex

changeset 6745 | 74e8f703f5f2 |

parent 6637 | 57abed64dc14 |

child 7829 | c2672c537894 |

--- a/doc-src/Inductive/ind-defs.tex Thu May 27 20:49:10 1999 +0200 +++ b/doc-src/Inductive/ind-defs.tex Fri May 28 11:42:07 1999 +0200 @@ -219,7 +219,7 @@ \end{eqnarray*} These equations are instances of the Knaster-Tarski theorem, which states that every monotonic function over a complete lattice has a -fixedpoint~\cite{davey&priestley}. It is obvious from their definitions +fixedpoint~\cite{davey-priestley}. It is obvious from their definitions that $\lfp$ must be the least fixedpoint, and $\gfp$ the greatest. This fixedpoint theory is simple. The Knaster-Tarski theorem is easy to