Weakly Associative Relation Algebras with Polyadic Composition Operations

Author: Stebletsova V.

Source: Studia Logica, Volume 66, Number 2, November 2000 , pp. 297-323(27)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: algebraic logic; relation algebras; relativization; representation

Language: English

Document Type: Regular paper

Affiliations: 1: Division of Mathematics and Computer Science Department of AI Vrije Universiteit De Boelelaan 1081a 1081 HV Amsterdam, The Netherlands vera@cs.vu.nl

Publication date: 2000-11-01

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page