Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T05:00:45.630Z Has data issue: false hasContentIssue false

RELEVANCE LOGICS AND RELATION ALGEBRAS

Published online by Cambridge University Press:  01 March 2009

KATALIN BIMBÓ*
Affiliation:
Department of Philosophy, University of Alberta
J. MICHAEL DUNN*
Affiliation:
School of Informatics, Indiana University
ROGER D. MADDUX*
Affiliation:
Department of Mathematics, Iowa State University
*
*DEPARTMENT OF PHILOSOPHY UNIVERSITY OF ALBERTA EDMONTON, AB, CANADA T6G 2E7, E-mail:bimbo@ualberta.ca, URL:www.ualberta.ca/~bimbo
†SCHOOL OF INFORMATICS INDIANA UNIVERSITY BLOOMINGTON, IN 47408-3912, E-mail:dunn@indiana.edu
‡DEPARTMENT OF MATHEMATICS IOWA STATE UNIVERSITY 396 CARVER HALL, AMES, IA 50011, E-mail:maddux@iastate.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Relevance logics are known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds of dynamic semantics (i.e., proper relation algebras and relevant families of relations). We prove several soundness results here. We also prove the completeness of a certain positive fragment of R as well as of the first-degree fragment of relevance logics. These results show that some core ideas are shared between relevance logics and relation algebras. Some details of certain incompleteness results, however, pinpoint where relevance logics and relation algebras diverge. To carry out these semantic investigations, we define a new tableaux formalization and new sequent calculi (with the single cut rule admissible) for various relevance logics.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009