- 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
Strong Cut-elimination In Display Logic
Reports on Mathematical Logic:117-131 (1995)
Abstract
It is shown that every displayable propositional logic enjoys strong cut-elimination. This result strengthens Belnap's general cut-elimination theorem for Display Logic.Author's Profile
My notes
Similar books and articles
Cut elimination for propositional dynamic logic without.Robert A. Bull - 1992 - Mathematical Logic Quarterly 38 (1):85-100.
Strong Cut-Elimination for Constant Domain First-Order S5.Heinrich Wansing - 1995 - Logic Journal of the IGPL 3 (5):797-810.
Cut-elimination Theorems of Some Infinitary Modal Logics.Yoshihito Tanaka - 2001 - Mathematical Logic Quarterly 47 (3):327-340.
Cut‐Elimination Theorem for the Logic of Constant Domains.Ryo Kashima & Tatsuya Shimura - 1994 - Mathematical Logic Quarterly 40 (2):153-172.
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
Bounds for cut elimination in intuitionistic propositional logic.Jörg Hudelmaier - 1992 - Archive for Mathematical Logic 31 (5):331-353.
Cut elimination for the unified logic.Jacqueline Vauzeilles - 1993 - Annals of Pure and Applied Logic 62 (1):1-16.
Cut-Elimination in the Strict Intersection Type Assignment System is Strongly Normalizing.Steffen van Bakel - 2004 - Notre Dame Journal of Formal Logic 45 (1):35-63.
On the non-confluence of cut-elimination.Matthias Baaz & Stefan Hetzl - 2011 - Journal of Symbolic Logic 76 (1):313 - 340.
Analytics
Added to PP
2015-02-12
Downloads
0
6 months
0
2015-02-12
Downloads
0
6 months
0
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Author's Profile
Citations of this work
The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations.Heinrich Wansing - 2000 - Studia Logica 64 (1):3-20.
Displaying the modal logic of consistency.Heinrich Wansing - 1999 - Journal of Symbolic Logic 64 (4):1573-1590.
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-6686886f5-7g5mb uwo