Commit bae02fd0 by Victor Lanvin

### Fixes in appendix

 ... ... @@ -788,8 +788,6 @@ This is equivalent to the wanted result. \end{proof} \pagebreak \begin{lemma}[$\worra {} {}$ alternative definition] The following algorithmic definition for $\worra {} {}$ is equivalent to the previous one: ... ... @@ -798,6 +796,8 @@ \end{lemma} \begin{proof} \begingroup \allowdisplaybreaks \begin{align*} \worra t s & = \dom t \wedge\bigvee_{i\in I}\left( \bigwedge_{\{P \subseteq P_i\alt s \leq \bigvee_{p \in P} \neg t_p\}} \left(\bigvee_{p \in P} \neg s_p \right)\right)\\ ... ... @@ -826,8 +826,8 @@ & \simeq \bigvee_{i \in I} \left( \bigvee_{\{P \subseteq P_i\alt s \not\leq \bigvee_{p \in P} \neg t_p \} }\left( \dom t \land \bigwedge_{p\in P_i} s_p \land \bigwedge_{n \in P_i \setminus P} \neg s_n \right)\right) \end{align*} \endgroup \end{proof} \pagebreak \begin{lemma}[Optimality of $\worra {} {}$] Let $t$, $s$, two types. ... ... @@ -1619,4 +1619,4 @@ \end{description} \end{proof} \newpage \ No newline at end of file \newpage