Weakly Associative Relation Algebras with Polyadic Composition Operations
by
V. Stebletsova
BibTeX
@MISC{Stebletsova_weaklyassociative,
author = {V. Stebletsova},
title = {Weakly Associative Relation Algebras with Polyadic Composition Operations},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider n-ary relative products j n on subsets of a reflexive and symmetric binary relation and define a variety of weakly associative relation algebras with polyadic composition operations (WA 1 ). A theorem that any A2 WA 1 is representable over a reflexive and symmetric relation is proved. We also show that the equational theory of WA 1 is decidable.
Citations
| 75 | Complexity of modal logic - Marx - 2007 |
| 28 | Step by step - building representation in Algebraic logic. J.Symbolic Logic - Hirsch, Hodkinson |
| 25 | Algebraic Relativization and Arrow Logic - Marx - 1995 |
| 17 | Taming Logics - Mikulas - 1995 |
| 12 | Boolean algebras with operators, part 1 - Jónsson, Tarski - 1951 |
| 9 | Decidability of relation algebras with weakened associativity - Németi - 1987 |
| 1 | Varieties containing relation algebras.Trans.Amer.Math - Maddux - 1982 |
