Weakly associative relation algebras with polyadic composition operations

Studia Logica 66 (2):297-323 (2000)
  Copy   BIBTEX

Abstract

In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA is a canonical variety whose equational theory is decidable.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,330

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
45 (#306,218)

6 months
3 (#424,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.

Add more citations

References found in this work

Varieties of complex algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
On the canonicity of Sahlqvist identities.Bjarni Jónsson - 1994 - Studia Logica 53 (4):473 - 491.

Add more references