“Proofnets for S5: sequents and circuits for modal logic,” pages 151–172 in Logic Colloquium 2005, C. Dimitracopoulos, L. Newelski, and D. Normann (eds.), number 28 in Lecture Notes in Logic. Cambridge University Press, 2007.

 download pdf

In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic).

The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in terms of the simple, universal Kripke semantics for S5. The sequent system is cut-free and the circuit proofs are normalising.

Do you like this, or do you have a comment? Then please  share or reply on Twitter, or  email me.

← Symbolic Logic | Writing Archive | Proof Theory and Meaning: on second order logic →


I’m Greg Restall, and this is my personal website. I teach philosophy and logic as Professor of Philosophy at the University of Melbourne. ¶ Start at the home page of this site—a compendium of recent additions around here—and go from there to learn more about who I am and what I do. ¶ This is my personal site on the web. Nothing here is in any way endorsed by the University of Melbourne.



To receive updates from this site, you can subscribe to the  RSS feed of all updates to the site in an RSS feed reader, or follow me on Twitter at  @consequently, where I’ll update you if anything is posted.