Refutations, proofs, and models in the modal logic K

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
2009-01-28

Downloads
52 (#222,092)

6 months
2 (#258,534)

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

Intuitionistic Socratic Procedures.Tomasz F. Skura - 2005 - Journal of Applied Non-Classical Logics 15 (4):453-464.
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

Modal Correspondence for Models.Jon Barwise & Lawrence S. Moss - 1998 - Journal of Philosophical Logic 27 (3):275-294.
On an Intuitionistic Modal Logic.G. M. Bierman & V. C. V. de Paiva - 2000 - Studia Logica 65 (3):383-416.
Modal Logic Over Finite Structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Explicit Provability and Constructive Semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Syntactic Refutations Against Finite Models in Modal Logic.Tomasz Skura - 1994 - Notre Dame Journal of Formal Logic 35 (4):595-605.