Axiomatizability of positive algebras of binary relations

DOI10.1007/s00012-011-0142-3zbMath1253.03091OpenAlexW2059559554MaRDI QIDQ647324

Szabolcs Mikulás, Hajnalka Andréka

Publication date: 23 November 2011

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-011-0142-3

zbMATH Keywords

equational theoryfinite axiomatizabilitypositive operationsquasi-equational theoryrepresentable relation algebras

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Equational classes, universal algebra in model theory (03C05) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Stone Relation Algebras ⋮ Reducts of relation algebras: the aspects of axiomatisability and finite representability ⋮ Language models for some extensions of the Lambek calculus ⋮ Semiring identities of finite inverse semigroups ⋮ On the variety generated by generalized subreducts of Tarski's algebras of relations ⋮ Relational Models for the Lambek Calculus with Intersection and Constants ⋮ Flat extensions of groups and limit varieties of additively idempotent semirings ⋮ The class of representable semilattice-ordered monoids is not a variety ⋮ Relational models for the Lambek calculus with intersection and unit ⋮ On Jónsson's problem for groupoids of relations with operation of binary cylindrification ⋮ The equational theory of Kleene lattices ⋮ Completeness for Identity-free Kleene Lattices ⋮ Verifying minimum spanning tree algorithms with Stone relation algebras ⋮ On varieties of groupoids of relations with operation of binary cylindrification. ⋮ Monoids with tests and the algebra of possibly non-halting programs ⋮ Unnamed Item ⋮ On algebras of binary relations with conjunctive operations ⋮ On generalized subreducts of Tarski's algebras of relations with the operation of bi-directional intersection ⋮ Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups ⋮ On classes of generalized subreducts of Tarski's relation algebras with one Diophantine binary operation ⋮ Nonfinitely based ai-semirings with finitely based semigroup reducts ⋮ Lower semilattice-ordered residuated semigroups and substructural logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equational properties of Kleene algebras of relations with conversion
• Relation algebras by games
• Relation algebras
• Every free algebra in the variety generated by the representable dynamic algebras is separable and representable
• Algebraization of quantifier logics, an introductory overview
• Lambek calculus and its relational semantics: Completeness and incompleteness
• A completeness theorem for Kleene algebras and the algebra of regular events
• The equational theory of union-free algebras of relations
• Equational theory of relation algebras with positive operations
• Adjoining units to residuated Boolean algebras
• Axiomatization of identity-free equations valid in relation algebras
• The variety of Kleene algebras with conversion is not finitely based
• Arguesian lattices which are not type-1
• Representations of distributive lattice-ordered semigroups with binary relations
• Representable semilattice-ordered monoids
• On representable relation algebras
• POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
• Representations of ordered semigroups and lattices by binary relations
• The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable

This page was built for publication: Axiomatizability of positive algebras of binary relations