- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The Basics of Display Calculi
Kriterion - Journal of Philosophy 31 (2):55-100 (2017)
Abstract
The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.Author Profiles
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 43-66.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, Advances in Modal Logic. CSLI Publications. pp. 43-66.
Hypersequent and Display Calculi – a Unified Perspective.Agata Ciabattoni, Revantha Ramanayake & Heinrich Wansing - 2014 - Studia Logica 102 (6):1245-1294.
Simple cut elimination proof for hybrid logic.Andrezj Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
Display calculi for logics with relative accessibility relations.Stéphane Demri & Rajeev Goré - 2000 - Journal of Logic, Language and Information 9 (2):213-236.
Simple cut elimination proof for hybrid logic.Andrzej Indrzejczak - 2016 - Logic and Logical Philosophy 25 (2):129-141.
Gaggles, Gentzen and Galois: how to display your favourite substructural logic.R. Gore - 1998 - Logic Journal of the IGPL 6 (5):669-694.
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2013 - In Sergei Artemov & Anil Nerode, Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 177-194.
Proof theory for quantified monotone modal logics.Sara Negri & Eugenio Orlandelli - 2019 - Logic Journal of the IGPL 27 (4):478-506.
Analytics
Added to PP
2018-02-13
Downloads
584 (#49,645)
6 months
106 (#58,540)
2018-02-13
Downloads
584 (#49,645)
6 months
106 (#58,540)
Historical graph of downloads
Author Profiles
References found in this work
Hypersequent and Display Calculi – a Unified Perspective.Agata Ciabattoni, Revantha Ramanayake & Heinrich Wansing - 2014 - Studia Logica 102 (6):1245-1294.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d47b8f9f5-pk6mj uwo