Pure Extensions, Proof Rules, and Hybrid Axiomatics - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Studia Logica Year : 2006

Pure Extensions, Proof Rules, and Hybrid Axiomatics


In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity). We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this requires the use of non-orthodox rules. We discuss these rules in detail and prove non-eliminability and eliminability results. We also show how another type of rule, which reflects the structure of the strong Priorean language, can be employed to give an even wider coverage of frame classes. We show that this deductive apparatus gets progressively simpler as we work our way up the expressivity hierarchy, and conclude the paper by showing that the approach transfers to first-order hybrid logic.

Dates and versions

inria-00119855 , version 1 (12-12-2006)



Patrick Blackburn, Balder ten Cate. Pure Extensions, Proof Rules, and Hybrid Axiomatics. Studia Logica, 2006, 84 (2), pp.277-322. ⟨10.1007/s11225-006-9009-6⟩. ⟨inria-00119855⟩
43 View
0 Download



Gmail Facebook X LinkedIn More