Higher-Order Syntax and Saturation Algorithms for Hybrid Logic

DOI10.1016/j.entcs.2006.11.023zbMath1278.03042OpenAlexW2025670570MaRDI QIDQ2867945

Moritz Hardt, Gert Smolka

Publication date: 20 December 2013

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.2006.11.023

zbMATH Keywords

modal logichybrid logiclambda calculustableau systemsdecision procedures

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Combinatory logic and lambda calculus (03B40)

Related Items

Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse, Hybrid Tableaux for the Difference Modality

Cites Work

• Proof methods for modal and intuitionistic logics
• Types, tableaus, and Gödel's God
• First-order modal logic
• Internalizing labelled deduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item