Higher-order syntax and saturation algorithms for hybrid logic

DOI10.1016/J.ENTCS.2006.11.023zbMATH Open1278.03042OpenAlexW2025670570MaRDI QIDQ2867945FDOQ2867945

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

Recommendations

• scientific article; zbMATH DE number 1696789
• Algebraic semantics for hybrid logics
• Hybrid logics: Characterization, interpolation and complexity
• Hybrid linear logic, revisited
• scientific article; zbMATH DE number 1926604
• Sequent calculus for hybrid logic
• Reasoning with higher-order abstract syntax in a logical framework
• Hybrid logic and its proof-theory
• Hybridized paracomplete and paraconsistent logics
• Algebraization of Hybrid Logic with Binders

zbMATH Keywords

modal logiclambda calculusdecision procedureshybrid logictableau systems

Mathematics Subject Classification ID

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

Cites Work

• Modal logic
• First-order modal logic
• Title not available (Why is that?)
• Proof methods for modal and intuitionistic logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Types, tableaus, and Gödel's God
• Internalizing labelled deduction
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
• Hybrid Tableaux for the Difference Modality

This page was built for publication: Higher-order syntax and saturation algorithms for hybrid logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867945)