Refutations,Proofs, and Models in the Modal Logic K4

In this paper we study the method of refutation rules in the modal logic K4. We introduce refutation rules with certain normal forms that provide a new syntactic decision procedure for this logic. As corollaries we obtain such results for the following important extensions: S4, the provability logic G, and Grzegorczyk's logic. We also show that tree-type models can be constructed from syntactic refutations of this kind.     

The Basic Algebra of Game Equivalences

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain minimal canonical form, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities.     

Modal Incompleteness Revisited

In this paper, we are going to analyze the phenomenon of modal incompleteness from an algebraic point of view. The usual method of showing that a given logic L is incomplete is to show that for some L and some cannot be separated from by a suitably wide class of complete algebras — usually Kripke algebras. We are going to show that classical examples of incomplete logics, e.g., Fine logic, are not complete with respect to any class of complete BAOs. Even above Grz it is possible to find a continuum of such logics, which immediately implies the existence of a continuum of neighbourhood-incomplete Grz logics. Similar results can be proved for Löb logics. In addition, completely incomplete logics above Grz may be found uniformly as a result of failures of some admissible rule of a special kind.     

Moral supervenience

Abstract

It is widely held, even among nonnaturalists, that the moral supervenes on the natural. This is to say that for any two metaphysically possible worlds w and w′, and for any entities x in w and y in w′, any isomorphism between x and y that preserves the natural properties preserves the moral properties. In this paper, I put forward a conceivability argument against moral supervenience, assuming non-naturalism. First, I argue that though utilitarianism may be true, and the trolley driver is permitted to kill the one to save the five, there is a conceivable scenario that is just like our world in all natural respects, yet at which deontology is true, and the trolly driver is not permitted to kill the one to save the five. I then argue that in the special case of morality, it is possible to infer from the conceivability of such a scenario to its possibility. It follows that supervenience is false.     

Modal structuralism simplified

Since Benacerraf’s ‘What Numbers Could Not Be,’ there has been a growing interest in mathematical structuralism. An influential form of mathematical structuralism, modal structuralism, uses logical possibility and second order logic to provide paraphrases of mathematical statements which don’t quantify over mathematical objects. These modal structuralist paraphrases are a useful tool for nominalists and realists alike. But their use of second order logic and quantification into the logical possibility operator raises concerns. In this paper, I show that the work of both these elements can be done by a single natural generalization of the logical possibility operator.