Relational proof system for relevant logics

Journal of Symbolic Logic 57 (4):1425-1440 (1992)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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
49 (#315,312)

6 months
12 (#198,566)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ewa Orlowska
Institute of Telecommunications and Information Technology

References found in this work

Entailment: The Logic of Relevance and Necessity.[author unknown] - 1975 - Studia Logica 54 (2):261-266.
Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
Cylindric Algebras.Leon Henkin & Alfred Tarski - 1967 - Journal of Symbolic Logic 32 (3):415-416.
The gentzenization and decidability of RW.Ross T. Brady - 1990 - Journal of Philosophical Logic 19 (1):35 - 73.

View all 15 references / Add more references