Term inequalities in finite algebras
Logic
2016-01-20 v1
Abstract
Given an algebra , and terms and of the language of , we say that and are {\em separated} in iff for all , and are never equal. We prove that given two terms that are separated in any algebra, there exists a finite algebra in which they are separated. As a corollary, we obtain that whenever the sentence is a universally quantified conjunction of negated atomic formulas, is consistent iff it has a finite model.
Keywords
Cite
@article{arxiv.1601.04911,
title = {Term inequalities in finite algebras},
author = {David Hobby},
journal= {arXiv preprint arXiv:1601.04911},
year = {2016}
}