Term inequalities in finite algebras
David Hobby

TL;DR
This paper proves that if two terms are separated in any algebra, they are also separated in some finite algebra, and shows that certain universally quantified negated formulas are satisfiable iff they have finite models.
Contribution
It establishes the existence of finite models for separated terms and for universally quantified negated formulas, connecting algebraic separation with finite model theory.
Findings
Separated terms in any algebra are separated in some finite algebra.
Universally quantified negated formulas are satisfiable iff they have finite models.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · semigroups and automata theory · Logic, Reasoning, and Knowledge
