Hostname: page-component-6898cfcb55-zkb6p Total loading time: 0 Render date: 2026-11-12T00:00:00.626Z Has data issue: false hasContentIssue false

Relational proof system for relevant logics

Published online by Cambridge University Press:  12 March 2014

Ewa Orlowska*
Affiliation:
Institute of Theoretical and Applied Computer Science, Polish Academy of Sciences
*
Azaliowa 29, 04-539 Warsaw, Poland, E-mail: orlowska@plearn.bitnet

Abstract

A method is presented for constructing natural deduction-style systems for propositional relevant logics. The method consists in first translating formulas of relevant logics into ternary relations, and then defining deduction rules for a corresponding logic of ternary relations. Proof systems of that form are given for various relevant logics. A class of algebras of ternary relations is introduced that provides a relation-algebraic semantics for relevant logics.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable