- #1

- 75

- 0

I understand that I am supposed to eliminate function symbols using the equality relation in [itex]\Sigma'[/itex], so that [itex] f()[/itex] in [itex]\Sigma[/itex] is translated to a relation symbol [itex]\ F(,) [/itex] , so that [itex]\ F(a,b)[/itex] holds iff [itex]\ f(a)=b [/itex] (and likewise for [itex] g() [/itex]).

the constants can be translated to 1-ary relation symbols.

Therefore, I have an intermediate dictionary

[tex]\Sigma'' = \left \{F(,),G(,),R(,),C_0(),C_1(),C_2(), = \right \}[/tex]

I need to somehow encode the six relation symbols (3 binary and 3 unary) in [itex] Q(,,,) [/itex]. Is there a particular way to do this, is this related to equivalence classes?

thank you.