Studia Logica 53 (2):299 - 324 (1994)
|Abstract||Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
D. M. Gabbay & U. Reyle (1997). Labelled Resolution for Classical and Non-Classical Logics. Studia Logica 59 (2):179-216.
Milan Božić & Kosta Došen (1984). Models for Normal Intuitionistic Modal Logics. Studia Logica 43 (3):217 - 245.
George Gargov & Valentin Goranko (1993). Modal Logic with Names. Journal of Philosophical Logic 22 (6):607 - 636.
Kosta Došen (1992). Modal Logic as Metalogic. Journal of Logic, Language and Information 1 (3):173-201.
Ramon Jansana (1995). Abstract Modal Logics. Studia Logica 55 (2):273 - 299.
Tomasz Skura (2002). Refutations, Proofs, and Models in the Modal Logic K. Studia Logica 70 (2):193 - 204.
Gerald J. Massey (1965). Four Simple Systems of Modal Propositional Logic. Philosophy of Science 32 (3/4):342-355.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads2 ( #232,575 of 549,122 )
Recent downloads (6 months)1 ( #63,361 of 549,122 )
How can I increase my downloads?