The Universal Theory of First Order Algebras and Various Reducts
Lawrence Valby

TL;DR
This paper develops a universal axiomatization for first order algebras and their reducts, providing a modular framework that encompasses various logical fragments and their algebraic structures.
Contribution
It introduces a universal set of axioms characterizing first order algebras and their reducts, extending to positive existential and quantifier-free cases.
Findings
Universal axioms characterize first order algebras.
Modular approach applies to various algebraic fragments.
Framework relates to theories and can incorporate function symbols.
Abstract
First order formulas in a relational signature can be considered as operations on the 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.
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
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Semantic Web and Ontologies
