Decidability of Relation Algebras with Weakened Associativity

DOI10.2307/2045968zbMath0638.03061OpenAlexW4230810274MaRDI QIDQ3778753

Istvan Németi

Publication date: 1987

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

Full work available at URL: https://doi.org/10.2307/2045968

zbMATH Keywords

decidabilityrelation algebrasvarietiescylindric algebrasequational theories

Mathematics Subject Classification ID

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

Related Items (10)

Decidable and undecidable logics with a binary modality ⋮ Taming logic ⋮ Relation algebras can tile ⋮ The finitely axiomatizable complete theories of non-associative arrow frames ⋮ A non-axiomatizability result in algebraic logic ⋮ Free algebras in discriminator varieties ⋮ First order logic without equality on relativized semantics ⋮ Weakly associative relation algebras with projections ⋮ On the Complexity of the Equational Theory of Residuated Boolean Algebras ⋮ Many-dimensional arrow logics

This page was built for publication: Decidability of Relation Algebras with Weakened Associativity