Graphical Sequent Calculi for Modal Logics

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

10 Citations (Scopus)

Abstract

The syntax of modal graphs is defined in terms of the continuous cut and broken cut following Charles Peirce's notation in the gamma part of his graphical logic of existential graphs. Graphical calculi for normal modal logics are developed based on a reformulation of the graphical calculus for classical propositional logic. These graphical calculi are of the nature of deep inference. The relationship between graphical calculi and sequent calculi for modal logics is shown by translations between graphs and modal formulas.

Original languageEnglish
Title of host publicationProceedings of the Ninth Workshop on Methods for Modalities
Subtitle of host publicationIndian Institute of Technology, Kanpur, India, 8th to 10th January 2017
EditorsSujata Ghosh, R. Ramanujam
PublisherOpen Publishing Association
Pages91-103
Number of pages13
DOIs
Publication statusPublished - 6 Mar 2017
Externally publishedYes
Event9th Workshop on Methods for Modalities, M4M 2017 - Kanpur, India
Duration: 8 Jan 201710 Jan 2017

Publication series

NameElectronic Proceedings in Theoretical Computer Science, EPTCS
PublisherOpen Publishing Association
Volume243
ISSN (Print)2075-2180

Conference

Conference9th Workshop on Methods for Modalities, M4M 2017
Country/TerritoryIndia
CityKanpur
Period8/01/1710/01/17

Scopus Subject Areas

  • Software

Cite this