Natural Deduction for Hybrid Logic

DOI10.1093/logcom/14.3.329zbMath1060.03036OpenAlexW2116784584MaRDI QIDQ4820470

Torben Braüner

Publication date: 15 October 2004

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cb7cd45bc65eb40318f4a7d42cee332a941465ce

zbMATH Keywords

hybrid logicnormalizationnatural deductionGentzen system

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (15)

An efficient approach to nominal equalities in hybrid logic tableaux ⋮ Type-safe higher-order channels with channel locality ⋮ Axioms for classical, intuitionistic, and paraconsistent hybrid logic ⋮ Pure extensions, proof rules, and hybrid axiomatics ⋮ Simple cut elimination proof for hybrid logic ⋮ The fundamental theorem of world theory ⋮ Natural deduction for first-order hybrid logic ⋮ A Two-Dimensional Hybrid Logic of Subset Spaces ⋮ Intuitionistic hybrid logic ⋮ A proof-theoretic study of the correspondence of hybrid logic and classical logic ⋮ ExpTime tableaux with global caching for hybrid PDL ⋮ 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? ⋮ Proof-theoretic functional completeness for the hybrid logics of everywhere and elsewhere

This page was built for publication: Natural Deduction for Hybrid Logic