Axiomatizability of positive algebras of binary relations
type: Item
instance of: scholarly article
title: Axiomatizability of positive algebras of binary relations
zbMATH Open document ID: 1253.03091
author: Szabolcs Mikulás
author: Hajnal Andréka
published in: Algebra Universalis
publication date: 2011-11-23T00:00:00Z
review text: The authors consider all the positive fragments in the signature of representable relation algebras (including extensions with reflexive transitive closure and both of the residuals of composition). They determine whether the first-order equational and quasi-equational theories of each fragment are finitely axiomatizable.
Mathematics Subject Classification ID: 03G15
Mathematics Subject Classification ID: 03C05
Mathematics Subject Classification ID: 06F05
zbMATH DE Number: 5977550
zbMATH Keywords: representable relation algebras
zbMATH Keywords: equational theory
zbMATH Keywords: quasi-equational theory
zbMATH Keywords: positive operations
zbMATH Keywords: finite axiomatizability
reviewed by: Roger Maddux
MaRDI profile type: Publication
full work available at URL: s00012-011-0142-3
OpenAlex ID: W2059559554
cites work: Representations of distributive lattice-ordered semigroups with binary relations
cites work: The equational theory of union-free algebras of relations
cites work: Lambek calculus and its relational semantics: Completeness and incompleteness
cites work: Axiomatization of identity-free equations valid in relation algebras
cites work: Q4789455
cites work: Equational theory of relation algebras with positive operations
cites work: Representations of ordered semigroups and lattices by binary relations
cites work: Q5639639
cites work: The variety of Kleene algebras with conversion is not finitely based
cites work: Equational properties of Kleene algebras of relations with conversion
cites work: Arguesian lattices which are not type-1
cites work: The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
cites work: Relation algebras by games
cites work: Representable semilattice-ordered monoids
cites work: POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
cites work: Adjoining units to residuated Boolean algebras
cites work: A completeness theorem for Kleene algebras and the algebra of regular events
cites work: Relation algebras
cites work: On representable relation algebras
cites work: Every free algebra in the variety generated by the representable dynamic algebras is separable and representable
cites work: Algebraization of quantifier logics, an introductory overview
cites work: Q4287490
cites work: Q4011733
DOI: 10.1007/S00012-011-0142-3
Recommended article: Axiomatizability of reducts of algebras of relations
Recommended article: Q3337519
Recommended article: On axiomatizations of Boolean algebras
Recommended article: Axiomatising Various Classes of Relation and Cylindric Algebras
Recommended article: Equational theory of relation algebras with positive operations
Recommended article: Algebraically closed structures in positive logic
Recommended article: A finite axiomatization of positive MV-algebras
Recommended article: Expressive power and succinctness of the positive calculus of binary relations
Recommended article: STABLE BINARY RELATIONS ON UNIVERSAL ALGEBRAS
Recommended article: On Positive Relational Calculi
description: scientific article; zbMATH DE number 5977550