Modal and Intensional Logic, Misc

This paper argues that modal realism has a problem with mathematical impossibilities. Due to the peculiar way it treats both propositions and mathematical objects, modal realism cannot distinguish the content of different mathematically impossible beliefs. While one might be happy to identify all logically impossible beliefs, there are many different mathematically impossible beliefs, none of which is a belief in a logical contradiction. The fact that it cannot distinguish these beliefs speaks against adopting modal realism.

This paper investigates the logic of reasons. Its aim is to provide an analysis of the sentences of the form ‘p is a reason for q’ that yields a coherent account of their logical properties. The idea that we will develop is that ‘p is a reason for q’ is acceptable just in case a suitably defined relation of incompatibility obtains between p and ¬q. As we will suggest, a theory of reasons based on this idea can solve three challenging (...) puzzles that concern, respectively, contraposing reasons, conflicting reasons, and supererogatory reasons, and opens a new perspective on some classical issues concerning non-deductive inferences. (shrink)

This book focuses on the problem of responsibility voids: these are cases where responsibility for a morally undesirable outcome cannot be attributed to any of the involved agents. Responsibility voids are thought to occur in collective decision-making and in the context of artificial intelligent systems. In these cases, philosophers worry that there is a shortfall of moral responsibility. In particular, such voids are often assumed to justify a notion of collective responsibility that cannot be reduced to individual responsibility. One of (...) the aims of the book is to study how collective responsibility and joint action relate to individual responsibility and individual actions. The book offers a unifying framework for modelling moral responsibility by drawing from modal logic and game theory. -/- The book investigates the possibility and scope of the problem of responsibility voids. One of its characteristics is its pluralistic perspective on moral responsibility: in contrast to giving a unique and all-encompassing definition of it, the book makes progress by spelling out and modelling several conceptions of moral responsibility. One of the appealing features of the book is that a relatively small range of models is used to investigate a variety of conceptions of moral responsibility. The unifying framework can thus be used to characterize the conditions under which responsibility voids are ruled out. (shrink)

This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...) and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

This article formulates five relative systems to evaluate the charge of self-refutation with regard to global relativism. It is demonstrated that all five of these systems support models with at least one thoroughly relativistic perspective. However, when these systems are extended to include an operator expressing the valuation of statements in a perspective, only one relative system, based on a nonnormal modal logic, supports a thoroughly relativistic perspective.

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called \emph{elementary}. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called \emph{canonical}. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...) results, and outline further research perspectives. (shrink)

In "An Alternative Semantics for Quantified Relevant Logic" (JSL 71 (2006)) we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every proposi- tional modal logic S. If S is canonical our models are based on propositional frames that validate S. We employ frames in which not every set of (...) worlds is an admissible proposition, and an alternative interpretation of the uni- versal quantifier using greatest lower bounds in the lattice of admissible propositions. Our models have a fixed domain of individuals, even in the absence of the Barcan formula. For systems with the Barcan formula it is possible to preserve the usual Tarskian reading of the quantifier, at the expensive of sometimes losing va- lidity of S in the underlying propositional frames. We apply our results to a number of logics, including S4.2, S4M and KW, whose quantified extensions are incomplete for the standard semantics. (shrink)

This paper uses an "admissible set semantics" to treat quantification in quantified modal logics. The truth condition for the universal quantifier states that a universally quantified statement (x)A(x) is true at a world w if and only if there is some proposition true at that world that entails every instance of A(x). It is shown that, for any canonical propositional modal logic the corresponding admissible set semantics characterises the quantified version of that modal logic.

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.