Definition 2.1 (Homomorphism).
Let
be -structures.
A function is an
-homomorphism
if:
-
(i)
For an -ary
function symbol ,
and
we have
|
-
(ii)
For an -ary
relation symbol ,
and
we have
|
-
(iii)
For any constant symbol ,
.
We write if
is an
-homomorphism.
If is also injective then this
is called an -embedding.
If is also bijective then this
is called an -isomorphism.