Sequent Calculi for Some Strict Implication Logics

Logic Journal of the IGPL 16 (2):155-174 (2008)
  Copy   BIBTEX

Abstract

We introduce various sequent systems for propositional logics having strict implication, and prove the completeness theorems and the finite model properties of these systems.The cut-elimination theorems or the subformula properties are proved semantically.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Sequent calculi for some trilattice logics.Norihiro Kamide & Heinrich Wansing - 2009 - Review of Symbolic Logic 2 (2):374-395.
Cut-free sequent calculi for some tense logics.Ryo Kashima - 1994 - Studia Logica 53 (1):119 - 135.
Sequent Calculi for Visser's Propositional Logics.Kentaro Kikuchi & Ryo Kashima - 2001 - Notre Dame Journal of Formal Logic 42 (1):1-22.
Cuts, Gluts and Gaps.Vincent Degauquier - 2012 - Logique Et Analyse 55 (218):229-240.
Symmetric and dual paraconsistent logics.Norihiro Kamide & Heinrich Wansing - 2010 - Logic and Logical Philosophy 19 (1-2):7-30.
Labeled sequent calculi for modal logics and implicit contractions.Pierluigi Minari - 2013 - Archive for Mathematical Logic 52 (7-8):881-907.
Natural Deduction Based upon Strict Implication for Normal Modal Logics.Claudio Cerrato - 1994 - Notre Dame Journal of Formal Logic 35 (4):471-495.
Modal sequents for normal modal logics.Claudio Cerrato - 1993 - Mathematical Logic Quarterly 39 (1):231-240.
Sequent-systems and groupoid models. I.Kosta Došen - 1988 - Studia Logica 47 (4):353 - 385.

Analytics

Added to PP
2015-02-04

Downloads
8 (#1,321,089)

6 months
4 (#796,002)

Historical graph of downloads
How can I increase my downloads?