Cut-free tableau calculi for some propositional normal modal logics

Studia Logica 57 (2-3):359 - 372 (1996)
Abstract
We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G 0(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G 0are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the so-called analytical cut-rule.In addition we show that G 0is not compact (and therefore not canonical), and we proof with the tableau-method that G 0is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G 0is decidable and also characterised by the class of all frames for G 0
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370840
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 35,865
Through your library

References found in this work BETA

Modal Tableau Calculi and Interpolation.Wolfgang Rautenberg - 1983 - Journal of Philosophical Logic 12 (4):403 - 423.
An Essay in Classical Modal Logic.Karl Krister Segerberg - 1971 - Dissertation, Stanford University

Add more references

Citations of this work BETA

Around Provability Logic.Leo Esakia - 2009 - Annals of Pure and Applied Logic 161 (2):174-184.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total downloads
49 ( #132,103 of 2,293,801 )

Recent downloads (6 months)
3 ( #182,547 of 2,293,801 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature