Higher-order syntax and saturation algorithms for hybrid logic
From MaRDI portal
Publication:2867945
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
Cites work
- scientific article; zbMATH DE number 1215461 (Why is no real title available?)
- scientific article; zbMATH DE number 1341482 (Why is no real title available?)
- scientific article; zbMATH DE number 1507180 (Why is no real title available?)
- scientific article; zbMATH DE number 932649 (Why is no real title available?)
- scientific article; zbMATH DE number 1424043 (Why is no real title available?)
- First-order modal logic
- Internalizing labelled deduction
- Modal logic
- Proof methods for modal and intuitionistic logics
- Types, tableaus, and Gödel's God
Cited in
(4)
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)