Reducts of relation algebras: the aspects of axiomatisability and finite representability
From MaRDI portal
Publication:2151415
DOI10.1007/978-3-030-93100-1_17OpenAlexW3194613918MaRDI QIDQ2151415
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2108.11692
relation algebrasalgebraic logicresiduated semigroupsfinite representation propertyjoin semilattice-ordered semigroups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatizability of positive algebras of binary relations
- Relation algebras by games
- Finite representability of semigroups with demonic refinement
- Residuated lattices. An algebraic glimpse at substructural logics
- A representation theorem for quantales
- Atom structures and Sahlqvist equations
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Axiomatizability of reducts of algebras of relations
- Ordered domain algebras
- MacNeille completions of lattice expansions
- Representable semilattice-ordered monoids
- On representable relation algebras
- The representation of relational algebras
- Domain range semigroups and finite representations
- Representability is not decidable for finite relation algebras
- The finite representation property for composition, intersection, domain and range
- The Mathematics of Sentence Structure
- Step by step – Building representations in algebraic logic
- Canonical varieties with no canonical axiomatisation
- The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
- Boolean Algebras with Operators. Part I
This page was built for publication: Reducts of relation algebras: the aspects of axiomatisability and finite representability
