You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
6 lines
269 B
6 lines
269 B
\item \lect
|
|
Given the formula
|
|
\begin{equation*}
|
|
\varphi_{EUF} \quad := \quad f(g(x))=f(y) \; \lor \; (z=g(y) \land z \neq f(z))
|
|
\end{equation*}
|
|
Apply the \emph{Ackermann} reduction algorithm to compute an equisatisfiable formula in $\mathcal{T}_{E}$.
|