Terminating Tableau Calculi for Hybrid Logics Extending K

DOI10.1016/j.entcs.2009.02.027zbMath1347.03039OpenAlexW2163429815WikidataQ57813472 ScholiaQ57813472MaRDI QIDQ4982112

Thomas Bolander

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.027

zbMATH Keywords

hybrid logictense logictableau systemsdecision proceduresloop-checks

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35)

Related Items (4)

A logic for diffusion in social networks ⋮ ExpTime tableaux with global caching for hybrid PDL ⋮ Why does the proof-theory of hybrid logic work so well? ⋮ Extended decision procedure for a fragment of HL with binders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nominal tense logic
• Modal logic with names
• Hybrid logics: characterization, interpolation and complexity
• Tableau-based Decision Procedures for Hybrid Logic
• Linguistics, Logic and Finite Trees
• Internalizing labelled deduction
• Computer Science Logic
• Termination for Hybrid Tableaus

This page was built for publication: Terminating Tableau Calculi for Hybrid Logics Extending K