doc-src/Inductive/ind-defs.tex

    \lfp(D,h)  & = & h(\lfp(D,h)) \\
    \gfp(D,h)  & = & h(\gfp(D,h)) 
 \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
 prove.  Showing monotonicity of~$h$ is trivial, in typical cases.  We must
 also exhibit a bounding set~$D$ for~$h$.  Frequently this is trivial, as when