Refutations, Proofs, and Models in the Modal Logic K4

Studia Logica 70 (2):193-204 (2002)

Abstract

In this paper we study the method of refutation rules in the modal logic K4. We introduce refutation rules with certain normal forms that provide a new syntactic decision procedure for this logic. As corollaries we obtain such results for the following important extensions: S4, the provability logic G, and Grzegorczyk's logic. We also show that tree-type models can be constructed from syntactic refutations of this kind.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,766

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2016-02-17

Downloads
8 (#1,014,522)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Citations of this work

Maximality and Refutability.Tom Skura - 2004 - Notre Dame Journal of Formal Logic 45 (2):65-72.
On Refutation Rules.Tomasz Skura - 2011 - Logica Universalis 5 (2):249-254.

Add more citations

Similar books and articles

On an Intuitionistic Modal Logic.G. M. Bierman & V. C. V. de Paiva - 2000 - Studia Logica 65 (3):383-416.
Elementary Classes in Basic Modal Logic.Holger Sturm - 2000 - Studia Logica 64 (2):193-213.
Willem Blok and Modal Logic.W. Rautenberg, M. Zakharyaschev & F. Wolter - 2006 - Studia Logica 83 (1-3):15-30.
A Note on Graded Modal Logic.Maarten de Rijke - 2000 - Studia Logica 64 (2):271-283.
Modality, Si! Modal Logic, No!John Mccarthy - 1997 - Studia Logica 59 (1):29-32.