Abstract
In this paper, we show the equivalence between the provability of a proof system of basic hybrid logic and that of translated formulas of the classical predicate logic with equality and explicit substitution by a purely proof-theoretic method. Then we show the equivalence of two groups of proof systems of hybrid logic: the group of labelled deduction systems and the group of modal logic-based systems.
Original language | English |
---|---|
Pages (from-to) | 35-61 |
Number of pages | 27 |
Journal | Journal of Logic, Language and Information |
Volume | 16 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2007 Jan |
Keywords
- Classical logic
- Hybrid logic
- Proof theory
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Philosophy
- Linguistics and Language