Studia Logica 69 (2):197-219 (2001)
The main goal of the paper is to suggest some analytic proof systems for LC and its finite-valued counterparts which are suitable for proof-search. This goal is achieved through following the general Rasiowa-Sikorski methodology for constructing analytic proof systems for semantically-defined logics. All the systems presented here are terminating, contraction-free, and based on invertible rules, which have a local character and at most two premises
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Normal Forms for Fuzzy Logics: A Proof-Theoretic Approach. [REVIEW]Petr Cintula & George Metcalfe - 2007 - Archive for Mathematical Logic 46 (5-6):347-363.
Similar books and articles
Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus.Wendy MacCaull & Ewa Orłlowska - 2002 - Studia Logica 71 (3):389-414.
The Method of Hypersequents in the Proof Theory of Propositional Non-Classical Logics.Arnon Avron - unknown
Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication.Dov M. Gabbay & Nicola Olivetti - 1998 - Studia Logica 61 (2):237-280.
Encoding Modal Logics in Logical Frameworks.Arnon Avron, Furio Honsell, Marino Miculan & Cristian Paravano - 1998 - Studia Logica 60 (1):161-208.
Relational Proof System for Relevant Logics.Ewa Orlowska - 1992 - Journal of Symbolic Logic 57 (4):1425-1440.
Multi-Valued Calculi for Logics Based on Non-Determinism.Arnon Avron & Beata Konikowska - 2005 - Logic Journal of the IGPL 13 (4):365-387.
Added to index2009-01-28
Total downloads16 ( #301,299 of 2,177,979 )
Recent downloads (6 months)6 ( #45,254 of 2,177,979 )
How can I increase my downloads?