Refutation systems in modal logic

Studia Logica 53 (2):299 - 324 (1994)
Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
GORRSI
Revision history
Archival date: 2018-04-21
View upload history
References found in this work BETA
On Proofs of Rejection.Staszek, Walenty
Proof of Ł-Decidability of Lewis System S.Słupecki, Jerzy & Bryll, Grzegorz
Proof of Ł-Decidability of Lewis System S5.Słupecki, Jerzy & Bryll, Grzegorz

Add more references

Citations of this work BETA

Add more citations

Added to PP index
2009-01-28

Total views
45 ( #30,592 of 38,900 )

Recent downloads (6 months)
6 ( #34,802 of 38,900 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.