Minor fixes.

diff --git a/PLAN b/PLAN
index a397476744e308fd1196a4329dac0b467f5b193f..ff4dd14e1c27c9e738e527a097c96f3633ffc9ca 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -64,7 +64,6 @@ Models:
 Ranking:
 
 - the general perspective: is it only a technical trick?
-- def. of ranking: do we need to write \prec explicitly?
 - move description of the ranking set to the chapter on models?
 - ranking of permutations on general sets, relationship with integer sorting
 

diff --git a/notation.tex b/notation.tex
index 1f74341d0ae532c45f561cdccd75e730b2e171a3..a572fe3bc87fe879128f4b70fc70b57b1fb1b8b3 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -60,7 +60,6 @@
 \n{$\bxor$}{bitwise non-equivalence: $(x\bxor y)[i]=1$ iff $x[i]\ne y[i]$}
 \n{$x \shl n$}{bitwise shift of~$x$ by $n$~positions to the left: $x\shl n = x\cdot 2^n$}
 \n{$x \shr n$}{bitwise shift of~$x$ by $n$~positions to the right: $x\shr n = \lfloor x/2^n \rfloor$}
-\n{$\prec$}{an~arbitrary linear order}
 \n{$R_{C,\prec}(x)$}{the rank of~$x$ in a~set~$C$ ordered by~$\prec$ \[rankdef]}
 \n{$R^{-1}_{C,\prec}(i)$}{the unrank of~$i$: the $i$-th smallest element of a~set~$C$ ordered by~$\prec$ \[rankdef]}
 \n{$[n]$}{the set $\{1,2,\ldots,n\}$ \[pranksect]}