Graphical Sequent Calculi for Modal Logics

Minghui Ma
(Sun Yat-Sen University)
Ahti-Veikko Pietarinen
(Tallinn University of Technology)

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.

In Sujata Ghosh and R. Ramanujam: Proceedings of the Ninth Workshop on Methods for Modalities (M4M9 2017), Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017, Electronic Proceedings in Theoretical Computer Science 243, pp. 91–103.
Published: 6th March 2017.

ArXived at: https://dx.doi.org/10.4204/EPTCS.243.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org