Refutation systems in modal logic

Studia Logica 53 (2):299 - 324 (1994)
Download Edit this record How to cite View on PhilPapers
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
Upload history
Archival date: 2018-04-21
View other versions
Added to PP index

Total views
89 ( #42,803 of 2,426,000 )

Recent downloads (6 months)
9 ( #50,468 of 2,426,000 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.