Gentzen-type formulation of the prepositional logic LQ
Studia Logica 47 (1):41 - 48 (1988)
| Abstract | We give a Gentzen-type formulation GQ for the intermediate logic LQ and prove the cut-elimination theorem on it, where LQ is the propositional logic obtained from the intuitionistic propositional logic LI by adding the axioms of the form AV A. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
|
| Through your library | Configure |
Mojtaba Aghaei & Mohammad Ardeshir (2001). Gentzen-Style Axiomatizations for Some Conservative Extensions of Basic Propositional Logic. Studia Logica 68 (2):263-285.
Jerzy Kotas & N. C. A. Costa (1979). A New Formulation of Discussive Logic. Studia Logica 38 (4):429 - 445.
Matthias Baaz & Rosalie Iemhoff (2006). Gentzen Calculi for the Existence Predicate. Studia Logica 82 (1):7 - 23.
Mamoru Kaneko (1999). Common Knowledge Logic and Game Logic. Journal of Symbolic Logic 64 (2):685-700.
Grigori Mints (1993). Resolution Calculus for the First Order Linear Logic. Journal of Logic, Language and Information 2 (1):59-83.
Branislav R. Boričić (1988). A Note on Sequent Calculi Intermediate Between LJ and LK. Studia Logica 47 (2):151 - 157.
Kentaro Kikuchi & Katsumi Sasaki (2003). A Cut-Free Gentzen Formulation of Basic Propositional Calculus. Journal of Logic, Language and Information 12 (2):213-225.
Branislav R. Boričić (1986). A Cut-Free Gentzen-Type System for the Logic of the Weak Law of Excluded Middle. Studia Logica 45 (1):39 - 53.
Anita Wasilewska (1984). DFC-Algorithms for Suszko Logic and One-to-One Gentzen Type Formalizations. Studia Logica 43 (4):395 - 404.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,501 of 549,087 )Recent downloads (6 months)0How can I increase my downloads? |

