An Algebraic Approach to the Disjunction Property of Substructural Logics

Notre Dame Journal of Formal Logic 48 (4):489-495 (2007)
  Copy   BIBTEX

Abstract

Some of the basic substructural logics are shown by Ono to have the disjunction property (DP) by using cut elimination of sequent calculi for these logics. On the other hand, this syntactic method works only for a limited number of substructural logics. Here we show that Maksimova's criterion on the DP of superintuitionistic logics can be naturally extended to one on the DP of substructural logics over FL. By using this, we show the DP for some of the substructural logics for which syntactic methods don't work well.

Links

PhilArchive



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

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
2010-08-24

Downloads
43 (#369,570)

6 months
16 (#156,807)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A cut-free sequent calculus for relevant logic RW.M. Ili & B. Bori I. - 2014 - Logic Journal of the IGPL 22 (4):673-695.
An Algebraic Approach to the Disjunction Property of Substructural Logics.Daisuke Souma - 2007 - Notre Dame Journal of Formal Logic 48 (4):489-495.
Variable Sharing in Substructural Logics: An Algebraic Characterization.Guillermo Badia - 2018 - Bulletin of the Section of Logic 47 (2):107-115.
Metacompleteness of Substructural Logics.Takahiro Seki - 2012 - Studia Logica 100 (6):1175-1199.
Conuclear Images of substructural logics.Giulia Frosoni - 2016 - Mathematical Logic Quarterly 62 (3):204-214.

Add more citations