Commit fce00ac6 authored by Giuseppe Castagna's avatar Giuseppe Castagna
Browse files

typo

parent 00aa768d
......@@ -224,13 +224,13 @@ intersections of arrows and of negations thereof.
If we change the union at issue into an intersection, it becomes
equivalent to our algorithmic definition of \emph{worra} (p13) as it can
be verified by a simple application of De Morgan's Laws. In that case
the formula yield $\tau_a=\True\land\False=\Empty$ and we obtain the
the formula yields $\tau_a=\True\land\False=\Empty$ and we obtain the
correct result $\Bool\setminus\Empty = \Bool$.
We would be grateful if the reviewer could confirm that we did not
misinterpret the definition in the dissertation. If it is so, was the
author aware of this problem and does there exist a corrected version of
the algorithm to which we could refer in our related work section? Thank
author aware of this problem and does a corrected version of
the algorithm exist to which we could refer in our related work section? Thank
you in advance.
\end{answer}
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment