Internalizing labelled deduction
From MaRDI portal
Publication:4952029
DOI10.1093/logcom/10.1.137zbMath0953.03018OpenAlexW2092576830MaRDI QIDQ4952029
Publication date: 23 January 2001
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/10.1.137
Related Items
An efficient approach to nominal equalities in hybrid logic tableaux, Axioms for classical, intuitionistic, and paraconsistent hybrid logic, Pure extensions, proof rules, and hybrid axiomatics, Expressive Power and Decidability for Memory Logics, A family of Gödel hybrid logics, Simple cut elimination proof for hybrid logic, Algebraic Semantics for Hybrid Logics, Using tableau to decide description logics with full role negation and identity, A Hybrid Public Announcement Logic with Distributed Knowledge, Proofs and countermodels in non-classical logics, Natural deduction for first-order hybrid logic, A Two-Dimensional Hybrid Logic of Subset Spaces, Intuitionistic hybrid logic, PROOF ANALYSIS FOR LEWIS COUNTERFACTUALS, A proof-theoretic study of the correspondence of hybrid logic and classical logic, Temporal Logics with Reference Pointers and Computation Tree Logics, ExpTime tableaux with global caching for hybrid PDL, Truth-values as labels: a general recipe for labelled deduction, Terminating Tableau Calculi for Hybrid Logics Extending K, Intuitionistic hybrid logic: introduction and survey, Sequent calculi and decidability for intuitionistic hybrid logic, Why does the proof-theory of hybrid logic work so well?, Higher-Order Syntax and Saturation Algorithms for Hybrid Logic, Testing XML constraint satisfiability, Towards a Hybrid Dynamic Logic for Hybrid Dynamic Systems, Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
