Terminating tableau systems for hybrid logic with difference and converse

This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.
Keywords Modal logic  Hybrid logic  Difference modality  Tableau systems  Decision procedures
Categories (categorize this paper)
DOI 10.1007/s10849-009-9087-8
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,890
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Saul A. Kripke (1963). Semantical Analysis of Modal Logic I. Normal Propositional Calculi. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (5‐6):67-96.
Maarten de Rijke (1992). The Modal Logic of Inequality. Journal of Symbolic Logic 57 (2):566-584.
George Gargov & Valentin Goranko (1993). Modal Logic with Names. Journal of Philosophical Logic 22 (6):607 - 636.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

13 ( #189,656 of 1,725,305 )

Recent downloads (6 months)

3 ( #210,899 of 1,725,305 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.