Internalizing labelled deduction

DOI10.1093/LOGCOM/10.1.137MaRDI QIDQ4952029zbMATH OpenOpenAlexFDO

Authors Patrick Blackburn

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

zbMATH Keywords

hybrid languageslabelled deductionmodal logic

Mathematics Subject Classification ID

Abstract deductive systems (03B22) Modal logic (including the logic of norms) (03B45)

Recommendations

• Internalization: The case of hybrid logics
• Hybrid logic and its proof-theory
• scientific article; zbMATH DE number 1749009
• Labelled propositional modal logics: theory and practice

Cited in

(33)

• A proof-theoretic study of the correspondence of hybrid logic and classical logic
• Natural deduction for first-order hybrid logic
• Proofs and countermodels in non-classical logics
• ExpTime tableaux with global caching for hybrid PDL
• Intuitionistic hybrid logic
• Internalization: The case of hybrid logics
• Proof analysis for Lewis counterfactuals
• Higher-order syntax and saturation algorithms for hybrid logic
• Testing XML constraint satisfiability
• Towards a hybrid dynamic logic for hybrid dynamic systems
• An efficient approach to nominal equalities in hybrid logic tableaux
• Simple cut elimination proof for hybrid logic
• Algebraic semantics for hybrid logics
• Expressive Power and Decidability for Memory Logics
• A Two-Dimensional Hybrid Logic of Subset Spaces
• Truth-values as labels: a general recipe for labelled deduction
• Why does the proof-theory of hybrid logic work so well?
• Temporal Logics with Reference Pointers and Computation Tree Logics
• A Hybrid Public Announcement Logic with Distributed Knowledge
• Terminating Tableau Calculi for Hybrid Logics Extending K
• Using tableau to decide description logics with full role negation and identity
• A family of Gödel hybrid logics
• Data-aware hybrid tableaux
• On temporal references via definite descriptions in first-order monadic logic of order
• Defining logical systems via algebraic constraints on proofs
• Games for hybrid logic from semantic games to analytic calculi
• A proof-theoretic approach to formal epistemology
• A complete tableau system for basic hybrid logic with propositional quantification
• Intuitionistic hybrid logic: introduction and survey
• Sequent calculi and decidability for intuitionistic hybrid logic
• Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere
• Axioms for classical, intuitionistic, and paraconsistent hybrid logic
• Pure extensions, proof rules, and hybrid axiomatics

This page was built for publication: Internalizing labelled deduction

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