Some results on relation algebra reducts: Residuated and semilattice-ordered semigroups. (7th November 2022)

• Record Type: Journal Article
• Authors: Rogozin, Daniel
• Is Part Of: Journal of logic and computation. Volume 32:Number 8(2022)
• Page Start: 1839
• Page End: 1854
• Publication Date: 2022-11-07
• Subjects: algebraic logic -- relation algebras -- residuated semigroups -- finite representability; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exac078
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive solution to Hirsch and Hodkinson (2002, Relation Algebras by Games ). The finite representation property for residuated semigroups also implies that the Lambek calculus has the finite model property with respect to relational models, the so-called $R$ -models. We also show that the class of representable join semilattice-ordered semigroups is pseudo-universal and it has a recursively enumerable axiomatization. For this purpose, we introduce representability games for join semilattice-ordered semigroups.