Let $\Sigma=\{c,f^1,R_1^2,...,R_k^2\}$ where $c$ is constant, $f$ is one argument function, and $R_i$ are binary relations. Let $\Sigma_2=\{c',g^2,R_1'^1,...,R_k'^1\}$ where $c'$ is constant, $g$ is two argument function, and $R_i'$ are unary relations.
Show an algorithm that given a formula $\varphi$ above $\Sigma$, returns a new formula $\varphi'$ above $\Sigma_2$ such that:
$\varphi$ is satisfiable above $\Sigma$$\iff$ $\varphi'$ is satisfiable above $\Sigma_2$
Well I have a partial solution, goes as follow:
Consider the next recursive definition:
$c\rightarrow c'$
$f(t)\rightarrow g(t',t')$
$R_i(t_1,t_2)\rightarrow R_i'(g(t_1',t_2'))$
The problem with the definition is that it not complete:
The function $g$ should have two roles:
- defining the values of $f(t)$
- Map elements of the form $(t_1,t_2)$ in a way that will allow $R_1'^1,...,R_k'^1$ to be consistent with $R_1^2,...,R_k^2$
I haven't found a way to define $g$, such that second requirement will be met.
Would appreciate help, hints will be helpful as well.