A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS
Journal of Symbolic Logic 48 (1):1 - 20 (1983)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download 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 |
Similar books and articlesH. C. M. de Swart (1983). A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS. Journal of Symbolic Logic 48 (1):1-20.
Grigori Mints (1993). Resolution Calculus for the First Order Linear Logic. Journal of Logic, Language and Information 2 (1):59-83.
A. Avron (2000). Implicational F-Structures and Implicational Relevance Logics. Journal of Symbolic Logic 65 (2):788-802.
Francesco Belardinelli, Peter Jipsen & Hiroakira Ono (2004). Algebraic Aspects of Cut Elimination. Studia Logica 77 (2):209 - 240.
Rajeev Goré (1994). Cut-Free Sequent and Tableau Systems for Propositional Diodorean Modal Logics. Studia Logica 53 (3):433 - 457.
Yde Venema (1995). Meeting Strength in Substructural Logics. Studia Logica 54 (1):3 - 32.
Anita Waselewska (1979). A Constructive Proof of Craig's Interpolation Lemma for M-Valued Logic. Studia Logica 38 (3):267 - 275.
Dorota Leszczyńska-Jasion (2009). A Loop-Free Decision Procedure for Modal Propositional Logics K4, S4 and S. Journal of Philosophical Logic 38 (2):151 - 177.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-05-29Total downloads1 ( #274,830 of 549,087 )Recent downloads (6 months)1 ( #63,317 of 549,087 )How can I increase my downloads? |
My notes
Discussion
