Decision problems for equational theories of relation algebras

DOI10.1090/memo/0604zbMath0877.03030OpenAlexW2064441356MaRDI QIDQ4338157

Istvan Németi, Steven Givant, Hajnalka Andréka

Publication date: 7 December 1997

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3a38a26a7bb3580577a6e62ed44a9aef3f09cefa

zbMATH Keywords

undecidabilitydecidabilityrelation algebrasprojective geometryequational theoryrepresentable relation algebrascomplete atomic Boolean algebradegree of complexityLyndon algebras\(n\)-frameBoolean algebraic reductgroup relation algebrassymmetric relation algebras

Mathematics Subject Classification ID

Lattices of varieties (08B15) Decidability of theories and sets of sentences (03B25) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (11)

Universal classes of simple relation algebras ⋮ Undecidable theories of Lyndon algebras ⋮ Segerberg Squares of Modal Logics and Theories of Relation Algebras ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS ⋮ Inequivalent representations of geometric relation algebras ⋮ Varieties of semiassociative relation algebras and tense algebras ⋮ An automatically verified prototype of the Tokeneer ID station specification ⋮ A proof system for contact relation algebras ⋮ Undecidability of Algebras of Binary Relations ⋮ On the Representation of Boolean Magmas and Boolean Semilattices

This page was built for publication: Decision problems for equational theories of relation algebras