Algebras of relations and relevance logic

Mikulás, Szabolcs (2009) Algebras of relations and relevance logic. Journal of Logic and Computation 19 (2), pp. 305-321. ISSN 0955-792X.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1093/logcom/exn099

Abstract

We prove that algebras of binary relations whose similarity type includes intersection, composition, converse negation and the identity constant form a non-finitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of relevant logic with respect to binary relations.

Metadata

Item Type:	Article
Keyword(s) / Subject(s):	relevance logic, completeness, De Morgan monoids, relation algebras, finite axiomatizability
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Administrator
Date Deposited:	02 Feb 2011 12:08
Last Modified:	09 Aug 2023 12:30
URI:	https://eprints.bbk.ac.uk/id/eprint/1895

Statistics

Archive Staff Only (login required)