deletions | additions       diff --git a/section_Fixpoint_Logics_for_Boolean__.tex b/section_Fixpoint_Logics_for_Boolean__.tex  index a41695d..217bcba 100644  --- a/section_Fixpoint_Logics_for_Boolean__.tex  +++ b/section_Fixpoint_Logics_for_Boolean__.tex 
...
\begin{proof}  \ldots  \end{proof}  We immediately obtain that the complexity of checking whether a given agent stabilizes in a given influence model is $O(m \cdot n^{2})$ with $n$ being the size of the model and $m$ the size of $\mu x. \Stb(p) \left(\nu y. \pm p \land \lbox{p} y \right)  \vee \lbox{p} x$. It is worth spending a few words on how this result relates to Lemmas \ref{lemma:influence} and \ref{lemma:opinion}, as well as Theorem \ref{theorem:convergence}.