Is it decidable if a finite set of equations have only trivial models?

132 Views Asked by At

Fix an algebraic signature $\Omega$. Let $F$ be a finite set of equations in $\Omega$. Is it decidable if the set $F$ has only trivial models? By trivial models, I mean one-element models. For example, if the set $F$ contains the equation $x=y$ then certainly it has only trivial models. However, perhaps the set $F$ does not contain $x=y$ but it still has only trivial models. I am wondering if the problem is decidable either way.

1

There are 1 best solutions below

4
On BEST ANSWER

No.

Perkins, Peter
Unsolvable problems for equational theories.
Notre Dame J. Formal Logic 8 (1967), 175-185.

states

Theorem 14. There is no effective method for determining whether or not an arbitrary finite set of equations in one binary operation symbol and no constants is consistent.