Switch to: Citations

References in:

Proofnets for S5: sequents and circuits for modal logic

In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172 (2007)

Add references

You must login to add references.
  1. (1 other version)The Province of Logic.Maurice L'Abbé - 1958 - Journal of Symbolic Logic 23 (2):210-212.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The Province of Logic.Richard Robinson - 1932 - Journal of Philosophy 29 (14):390-391.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Province of Logic.Charles Sayward - 1975 - Analysis 36 (1):47-48.
    Quine criticizes Strawson’s account of the province of logic. Robert Hadley proposes a refutation of Quine. This paper proposes a refutation of Hadley.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Indexed systems of sequents and cut-elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
    Cut reductions are defined for a Kripke-style formulation of modal logic in terms of indexed systems of sequents. A detailed proof of the normalization (cutelimination) theorem is given. The proof is uniform for the propositional modal systems with all combinations of reflexivity, symmetry and transitivity for the accessibility relation. Some new transformations of derivations (compared to standard sequent formulations) are needed, and some additional properties are to be checked. The display formulations [1] of the systems considered can be presented as (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Display logic.Nuel D. Belnap - 1982 - Journal of Philosophical Logic 11 (4):375-417.
    Download  
     
    Export citation  
     
    Bookmark   112 citations  
  • Cut-free double sequent calculus for S5.A. Indrzejczak - 1998 - Logic Journal of the IGPL 6 (3):505-516.
    We aim at an exposition of some nonstandard cut-free Gentzen formalization for S5, called DSC . DSC operates on two types of sequents instead of one, and shifting of wffs from one side of a sequent to the other is regulated by special rules and subject to some restrictions. Despite of this apparent inconvenience it seems to be simpler than other, known Gentzen-style systems for S5. The number of additional formal machinery is kept in reasonable bounds. Rules have subformula-property, hence (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The structure of multiplicatives.Vincent Danos & Laurent Regnier - 1989 - Archive for Mathematical Logic 28 (3):181-203.
    Investigating Girard's new propositionnal calculus which aims at a large scale study of computation, we stumble quickly on that question: What is a multiplicative connective? We give here a detailed answer together with our motivations and expectations.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • The method of hypersequents in the proof theory of propositional non-classical logics.Arnon Avron - 1977 - In Wilfrid Hodges (ed.), Logic. New York: Penguin Books. pp. 1-32.
    Until not too many years ago, all logics except classical logic (and, perhaps, intuitionistic logic too) were considered to be things esoteric. Today this state of a airs seems to have completely been changed. There is a growing interest in many types of nonclassical logics: modal and temporal logics, substructural logics, paraconsistent logics, non-monotonic logics { the list is long. The diversity of systems that have been proposed and studied is so great that a need is felt by many researchers (...)
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • Sequent-systems for modal logic.Kosta Došen - 1985 - Journal of Symbolic Logic 50 (1):149-168.
    The purpose of this work is to present Gentzen-style formulations of S5 and S4 based on sequents of higher levels. Sequents of level 1 are like ordinary sequents, sequents of level 1 have collections of sequents of level 1 on the left and right of the turnstile, etc. Rules for modal constants involve sequents of level 2, whereas rules for customary logical constants of first-order logic with identity involve only sequents of level 1. A restriction on Thinning on the right (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • A constructive analysis of RM.Arnon Avron - 1987 - Journal of Symbolic Logic 52 (4):939 - 951.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Translation of hypersequents into display sequents.H. Wansing - 1998 - Logic Journal of the IGPL 6 (5):719-734.
    Download  
     
    Export citation  
     
    Bookmark   8 citations