In this paper we continue the investigation of monadic Heyting algebras which we started in [2]. Here we present the representation theorem for monadic Heyting algebras and develop the duality theory for them. As a result we obtain an adequate topological semantics for intuitionistic modal logics over MIPC along with a Kripke-type semantics for them. It is also shown the importance and the effectiveness of the duality theory for further investigation of monadic Heyting algebras and logics over MIPC.

Kripke bundle [3] and C-set semantics [1] [2] are known as semantics which generalize standard Kripke semantics. In [3] and in [1], [2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics [5].In this paper, we show that Q-S4.1 is not Kripke bundle complete via C-set models. As a corollary we can give a simple proof showing that C-set (...) semantics for modal logics are stronger than Kripke bundle semantics. (shrink)

In so-called Kripke-type models, each sentence is assigned either to true or to false at each possible world. In this setting, every possible world has the two-valued Boolean algebra as the set of truth values. Instead, we take a collection of algebras each of which is attached to a world as the set of truth values at the world, and obtain an extended semantics based on the traditional Kripke-type semantics, which we call here the algebraic Kripke semantics. We introduce algebraic (...) Kripke sheaf semantics for super-intuitionistic and modal predicate logics, and discuss some basic properties. We can state the Gödel-McKinsey-Tarski translation theorem within this semantics. Further, we show new results on super-intuitionistic predicate logics. We prove that there exists a continuum of super-intuitionistic predicate logics each of which has both of the disjunction and existence properties and moreover the same propositional fragment as the intuitionistic logic. (shrink)

Standard models for model predicate logic consist of a Kripke frame whose worlds come equipped with relational structures. Both modal and two-sorted predicate logic are natural languages for speaking about such models. In this paper we compare their expressivity. We determine a fragment of the two-sorted language for which the modal language is expressively complete on S5-models. Decidable criteria for modal definability are presented.

We present a general approach to quantified modal logics that can simulate most other approaches. The language is based on operators indexed by terms which allow to express de re modalities and to control the interaction of modalities with the first-order machinery and with non-rigid designators. The semantics is based on a primitive counterpart relation holding between n-tuples of objects inhabiting possible worlds. This allows an object to be represented by one, many, or no object in an accessible world. Moreover (...) by taking as primitive a relation between n-tuples we avoid some shortcoming of standard individual counterparts. Finally, we use cut-free labelled sequent calculi to give a proof-theoretic characterisation of the quantified extensions of each first-order definable propositional modal logic. In this way we show how to complete many axiomatically incomplete quantified modal logics. (shrink)

This chapter contains sections titled: Introduction Modal propositional Logics (MPLs) Modal Quantificational Logics(QMLs).

In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and $\textbf {QGrz.3}$ is $\Pi ^1_1$-hard even in languages with three (sometimes, two) individual variables, two (sometimes, one) unary predicate letters, and a single (...) proposition letter. As a corollary, it is proved that infinite families of modal predicate axiomatic systems, based on the classical first-order logic and the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ are not Kripke complete. Both $\Pi ^1_1$-hardness and Kripke incompleteness results of the paper do not depend on whether the logics contain the Barcan formula. (shrink)

This article builds on Humberstone’s idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, (...) we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information. (shrink)

David Lewis proposed to deal with the semantics of sentences that state what is possible for an individual in terms of possible individuals that are in ways the first individual might have been, so called counterparts of the individual. In this book, I defend counterpart semantics as an approach to the semantics of modality and natural language semantics in particular. Counterpart semantics has a rival, the standard Kripkean semantics that deals with the same sentences in terms of an accessibility relation (...) between possible worlds. While counterpart semantics appears to be more flexible and carries less metaphysical presuppositions (it does not presuppose that I myself exist in various possible worlds, e.g.), Kripkean semantics has some advantages of its own. Most importantly, it incorporates the core assumptions of what may be called standard possible-worlds semantics; i.e. the core assumptions of the most successful framework within linguistic semantics. Counterpart semantics, on the other hand, does not conform to these assumptions, or so I will argue. In this book I opt for a synthesis of these two approaches that allows to combine their advantages. In Chap.1 I introduce the basic idea of counterpart semantics. I defend counterparts against the charge, made by Kripke, that counterparts are irrelevant for the analysis of modality. In Chap. 2 I present the classical version of counterpart semantics, i.e. David Lewis's translation of the language of quantified modal logic into counterpart theory. I discuss some well-known problems and opt for a revision of that translation that is able to solve the problems. Lewis's translation indirectly defines semantical values for expressions of quantified modal logic. In Chap.3 I evaluate counterpart semantics with respect to basic features of possible-worlds semantics. I conclude that the semantical values indirectly assigned to sentences by Lewis's translation are not sets of possible worlds, and that they do not meet certain intuitive demands on notions of meaning and content. (The revisions proposed in Chap.2 do not change this.) In Chap.4 I discuss various versions of a combination of counterpart semantics with Kripkean semantics found in the literature. But I conclude that here, the benefits of the latter are achieved by forfeiting the advantages of the former. Chap.5 finally contains my own proposal how to combine the two approaches in a more satisfactory way. The core semantical notion is truth according to a maximal complete representation, where representations now play the role of worlds. It is an important feature of the counterpart relation that it is qualitative, i.e. a relation in which things stand in virtue how they are. In Chap.1 I point out why it is qualitative, and why it ought to be. In Chap.6 I show how to make the notion of a qualitative property or relation precise. Finally, in Chap.7 I show how to extend this and related notions to predicates and propositions. For counterpart semantics to work at all we have to assume that everything that can be said at all can in principle be expressed in a language with qualitative predicates only (and perhaps, additionally, names, treated directly referentially). In Chap.7 I show how this assumption allows to maintain that the representations of our semantics deserve their name. (shrink)