In the present paper, we continue the research in Zhao (2021, Logic J. IGPL) to develop the Sahlqvist completeness theory for hybrid logic with satisfaction operators and downarrow binders |$\mathcal {L}( @, {\downarrow })$|⁠. We define the class of restricted Sahlqvist formulas for |$\mathcal {L}( @, {\downarrow })$| following the ideas in Conradie and Robinson (2017, J. Logic Comput., 27, 867–900), but we follow a different proof strategy which is purely proof-theoretic, namely showing that for every restricted Sahlqvist formula |$\varphi (...) $| and its hybrid pure correspondence |$\pi $|⁠, |$\textbf {K}_{\mathcal {H}( @, {\downarrow })}+\varphi $| proves |$\pi $|⁠; therefore, |$\textbf {K}_{\mathcal {H}( @, {\downarrow })}+\varphi $| is complete with respect to the class of frames defined by |$\pi $|⁠, using a modified version |$\textsf {ALBA}^{{\downarrow }}_{\textsf {Modified}}$| of the algorithm |$\textsf {ALBA}^{{\downarrow }}$| defined in Zhao (2021, Logic J. IGPL). (shrink)

The purpose of this paper is to argue that the hybrid formalism fits naturally in the context of David Lewis’s counterfactual logic and that its introduction into this framework is desirable. This hybridization enables us to regard the inference “The pig is Mary; Mary is pregnant; therefore the pig is pregnant” as a process of updating local information (which depends on the given situation) by using global information (independent of the situation). Our hybridization also has the following technical advantages: (i) (...) it preserves the completeness and decidability of Lewis’s logic; (ii) it allows us to characterize the Limit Assumption as a proof-rule with some side-conditions; and (iii) it enables us to establish a general Kripke completeness result by using the proof-rule corresponding to the Limit Assumption. Keywords Counterfactual logic - David Lewis - Contextually definite description - Hybrid logic - Arthur Prior - The limit assumption - Strong completeness - Decidability - Bisimulation - Pure completeness. (shrink)

In this article we define a logical system called Hybrid Partial Type Theory ( $\mathcal {HPTT}$ ). The system is obtained by combining William Farmer’s partial type theory with a strong form of hybrid logic. William Farmer’s system is a version of Church’s theory of types which allows terms to be non-denoting; hybrid logic is a version of modal logic in which it is possible to name worlds and evaluate expressions with respect to particular worlds. We motivate this combination of (...) ideas in the introduction, and devote the rest of the article to defining, axiomatising, and proving a completeness result for $\mathcal {HPTT}$. (shrink)

Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, The completeness of the first-order functional calculus (...) and Completeness in propositional type theory. More precisely, from and we take the idea of building the model described by the maximal consistent set; in our case the maximal consistent set has to be named, \-saturated and extensionally algebraic-saturated due to the hybrid and equational nature of \. From, we use the result that any element in the hierarchy has a name. The challenge was to deal with all the heterogeneous components in an integrated system. (shrink)

Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, The completeness of the first-order functional calculus (...) and Completeness in propositional type theory. More precisely, from and we take the idea of building the model described by the maximal consistent set; in our case the maximal consistent set has to be named, \-saturated and extensionally algebraic-saturated due to the hybrid and equational nature of \. From, we use the result that any element in the hierarchy has a name. The challenge was to deal with all the heterogeneous components in an integrated system. (shrink)

This is an extended version of the lectures given during the 12-thConference on Applications of Logic in Philosophy and in the Foundationsof Mathematics in Szklarska Poręba. It contains a surveyof modal hybrid logic, one of the branches of contemporary modal logic. Inthe first part a variety of hybrid languages and logics is presented with adiscussion of expressivity matters. The second part is devoted to thoroughexposition of proof methods for hybrid logics. The main point is to showthat application of hybrid logics (...) may remarkably improve the situation inmodal proof theory. (shrink)

Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since (...) justification logics are newer and less well-known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here. (shrink)

This paper introduces a general logical framework for reasoning about diffusion processes within social networks. The new “Logic for Diffusion in Social Networks” is a dynamic extension of standard hybrid logic, allowing to model complex phenomena involving several properties of agents. We provide a complete axiomatization and a terminating and complete tableau system for this logic and show how to apply the framework to diffusion phenomena documented in social networks analysis.

Imagining is something we use everyday in our lives and in a wide variety of ways. In spite of the amount of works devoted to its study from both psychology and philosophy, there are only a few formal systems capable of modelling it; besides, almost all of those systems are static, in the sense that their models are initially predefined, and they fail to capture the dynamic process behind the creation of new imaginary scenarios. In this work, we review some (...) influential theories of imagination and use their insights to distil an algorithm describing such process. Then, we use this algorithm to define a dynamic logical system built upon on a single-agent epistemic logic that provides the necessary tools to capture how the agent voluntarily creates new imaginary worlds; in other words, our system allows the model to be expanded dynamically at any time as a result of the agent performing an act of imagination. Furthermore, we provide an axiomatization and prove that the system is sound and complete. (shrink)

In this paper we give axiom systems for classical and intuitionistic hybrid logic. Our axiom systems can be extended with additional rules corresponding to conditions on the accessibility relation expressed by so-called geometric theories. In the classical case other axiomatisations than ours can be found in the literature but in the intuitionistic case no axiomatisations have been published. We consider plain intuitionistic hybrid logic as well as a hybridized version of the constructive and paraconsistent logic N4.

This paper introduces an axiomatisation for equational hybrid logic based on previous axiomatizations and natural deduction systems for propositional and first-order hybrid logic. Its soundness and completeness is discussed. This work is part of a broader research project on the development a general proof calculus for hybrid logics.

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret $@_i$ in propositional and first-order hybrid logic. This means: interpret $@_i\alpha _a$ , where $\alpha _a$ is an expression of any type $a$ , as an expression of type $a$ that (...) rigidly returns the value that $\alpha_a$ receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

We show that basic hybridization makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i$\end{document} in propositional and first-order hybrid logic. This means: interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i\alpha _a$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha _a$\end{document} is an expression of any type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document}, as an expression of type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document} that rigidly returns the value that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha_a$\end{document} receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)