deletions | additions       diff --git a/section_BDPs_on_logically_interdependent__.tex b/section_BDPs_on_logically_interdependent__.tex  index 3fbb9cc..144e4a2 100644  --- a/section_BDPs_on_logically_interdependent__.tex  +++ b/section_BDPs_on_logically_interdependent__.tex 
...
\subsection{Preliminaries}  We consider now binary aggregation structures with constraints: constraints \cite{Grandi_2013}:  $\S = \tuple{\N,\Atoms, \C}$ where $\C \subseteq \L$ is a finite set of propositional formulas over $\Atoms$. Intuitively, such formulas make explicit the logical interdependencies among the issues in $\Atoms$. \begin{example}  The binary aggregation structure (with constraints) of the discoursive paradox is:   $\N = \set{1,2,3}$, $\Atoms = \set{p, q, r}$ and $\C= \set{p \lequiv (q \land r)}$