Hajnal Andreka

The equational theories of representable positive cylindric and relation algebras are decidable

Abstract: We obtain positive representable cylindric algebras by omitting complementation from the operations, while keeping union, intersection, empty set, and biggest set; and the extra Boolean operations, of course. We prove that the equational theory of this class is decidable. We do not know whether the equational theory remains decidable if we add dual cylindrifications to the operations. The case of relation algebras is analogous.

Retrieve dvi, PostScript or PDF version.