doc-src/Logics/CTT.tex
changeset 6072 5583261db33d
parent 5151 1e944fe5ce96
child 6170 9a59cf8ae9b5
--- a/doc-src/Logics/CTT.tex	Fri Jan 08 13:20:59 1999 +0100
+++ b/doc-src/Logics/CTT.tex	Fri Jan 08 14:02:04 1999 +0100
@@ -178,10 +178,10 @@
 the one-element type is $T$; other finite types are built as $T+T+T$, etc.
 
 \index{*SUM symbol}\index{*PROD symbol}
-Quantification is expressed using general sums $\sum@{x\in A}B[x]$ and
+Quantification is expressed by sums $\sum@{x\in A}B[x]$ and
 products $\prod@{x\in A}B[x]$.  Instead of {\tt Sum($A$,$B$)} and {\tt
-  Prod($A$,$B$)} we may write \hbox{\tt SUM $x$:$A$. $B[x]$} and \hbox{\tt
-  PROD $x$:$A$. $B[x]$}.  For example, we may write
+  Prod($A$,$B$)} we may write \hbox{\tt SUM $x$:$A$.\ $B[x]$} and \hbox{\tt
+  PROD $x$:$A$.\ $B[x]$}.  For example, we may write
 \begin{ttbox}
 SUM y:B. PROD x:A. C(x,y)   {\rm for}   Sum(B, \%y. Prod(A, \%x. C(x,y)))
 \end{ttbox}