Terminating tableau systems for hybrid logic with difference and converse

Abstract
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)
Options
 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: 9,360
External links
  • Through your library Configure
    References found in this work BETA
    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.
    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.
    Citations of this work BETA
    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-04-27

    Total downloads

    6 ( #162,855 of 1,088,810 )

    Recent downloads (6 months)

    1 ( #69,666 of 1,088,810 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


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