Displaying and deciding substructural logics 1: Logics with contraposition

Journal of Philosophical Logic 27 (2):179-216 (1998)
  Copy   BIBTEX

Abstract

Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic. However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

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
162 (#122,204)

6 months
16 (#171,938)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Greg Restall
University of Melbourne

References found in this work

Entailment: The Logic of Relevance and Neccessity, Vol. I.Alan Ross Anderson & Nuel D. Belnap - 1975 - Princeton, N.J.: Princeton University Press. Edited by Nuel D. Belnap & J. Michael Dunn.
Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.
Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
Gupta's rule of revision theory of truth.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (1):103-116.

View all 13 references / Add more references