Refutation systems in modal logic

Studia Logica 53 (2):299 - 324 (1994)
  Copy   BIBTEX


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.

Author's Profile

Valentin Goranko
Stockholm University


Added to PP

195 (#46,649)

6 months
60 (#26,827)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?