arXiv Analytics

Sign in

arXiv:1403.1805 [math.LO]AbstractReferencesReviewsResources

The Universal Theory of First Order Algebras and Various Reducts

Lawrence Valby

Published 2014-03-07, updated 2014-08-20Version 2

First order formulas in a finite relational signature can be considered as operations on the finitary relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies the axioms iff it embeds into a first order algebra. Importantly, our argument is modular and also works for, e.g., the positive existential algebras (where we restrict attention to the positive existential formulas) and the quantifier-free algebras. We also explain the relationship to theories, and indicate how to add in function symbols.

Related articles: Most relevant | Search more
arXiv:2006.05629 [math.LO] (Published 2020-06-10)
The Universal Theory Of The Hyperfinite II$_1$ Factor Is Not Computable
arXiv:2312.16650 [math.LO] (Published 2023-12-27)
Axiomatizability of hereditary classes of structures of finite and infinite languages and decidability of their universal theories
arXiv:1012.2381 [math.LO] (Published 2010-12-10, updated 2012-03-04)
Decidability of definability