Révision 253 CSL17/preliminaries.tex
| preliminaries.tex (revision 253) | ||
|---|---|---|
| 157 | 157 |
For that let us first define the function $\shorten(l;x)$ which returns the $|x|- |l|$ prefix of $x$, as follows: |
| 158 | 158 |
\begin{eqnarray*}
|
| 159 | 159 |
\shorten(0;x) &=&x\\ |
| 160 |
\shorten(\succ{i}l;x) &=&p(;\shorten(l;x)) \mbox{ if $l\neq 0$.}
|
|
| 160 |
\shorten(\succ{i}l;x) &=&p(;\shorten(l;x))
|
|
| 161 | 161 |
\end{eqnarray*}
|
| 162 | 162 |
Then we define $\bit(l;x)$ as follows: |
| 163 | 163 |
$$\bit(l;x)=C(;\shorten(l;x),0,1).$$ |
Formats disponibles : Unified diff