deletions | additions       diff --git a/bits4.tex b/bits4.tex  index 690849d..821b4b6 100644  --- a/bits4.tex  +++ b/bits4.tex 
...
$f (x, y, z) = x + y$  \end{Example}  In general we have  \begin{Theorem}[Absolute \begin{theorem}[Absolute  Normal Form Theorem] Any function $f$ from $(\Fb)^n$ to $\Fb$ , with $n \in \NN$,   (i.e., any function   with n binary inputs and  only one binary output) can be written by   the sum of squared free monomials  with coefficients in $\Fb$, up to degree $n$, i.e.,  \end{Theorem} \end{theorem}