Studia Logica 69 (2):197-219 (2001)
|Abstract||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||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Pavel Hrubeš (2007). Lower Bounds for Modal Logics. Journal of Symbolic Logic 72 (3):941 - 958.
Luca Viganò (2000). Labelled Non-Classical Logics. Kluwer Academic Publishers.
Wendy MacCaull & Ewa Orłlowska (2002). Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus. Studia Logica 71 (3):389-414.
Sara Negri (2011). Proof Analysis: A Contribution to Hilbert's Last Problem. Cambridge University Press.
Dov M. Gabbay & Nicola Olivetti (1998). Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication. Studia Logica 61 (2):237-280.
Arnon Avron, Furio Honsell, Marino Miculan & Cristian Paravano (1998). Encoding Modal Logics in Logical Frameworks. Studia Logica 60 (1):161-208.
Ewa Orlowska (1992). Relational Proof System for Relevant Logics. Journal of Symbolic Logic 57 (4):1425-1440.
Dov M. Gabbay (2000). Goal-Directed Proof Theory. Kluwer Academic.
Added to index2009-01-28
Total downloads2 ( #245,680 of 722,744 )
Recent downloads (6 months)1 ( #60,247 of 722,744 )
How can I increase my downloads?