Conflicting imperatives and dyadic deontic logic

Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to handle normative conflicts were devised by B. van Fraassen and J.F. Horty, but these are not sensitive to circumstances. The present paper extends these resolution mechanisms to circumstantial inputs, defines dyadic deontic operators accordingly, and provides a sound and (weakly) complete axiomatic system for such deontic semantics.     

Moral relativism and deontic logic

If a native of India asserts “Killing cattle is wrong” and a Nebraskan asserts “Killing cattle is not wrong”, and both judgments agree with their respective moralities and both moralities are internally consistent, then the moral relativist says both judgments are fully correct. At this point relativism bifurcates. One branch which we call content relativism denies that the two people are contradicting each other. The idea is that the content of a moral judgment is a function of the overall moral point of view from which it proceeds. The second branch which we call truth value relativism affirms that the two judgments are contradictory. Truth value relativism appears to be logically incoherent. How can contradictory judgments be fully correct? For though there will be a sense of correctness in which each judgment is correct — namely by that of being correct relative to the morality relative to which each was expressed — if contradictory, the judgments cannot both be true, and thus cannot both be correct in this most basic sense of correctness. We defend truth value relativism against this sort of charge of logical incoherence by showing it can be accommodated by the existing semantical metatheories of deontic logic. Having done this we go on to argue that truth value relativism is the best version of relativism.     

A deontic logic of action

The formal language studied in this paper contains two categories of expressions, terms and formulas. Terms express events, formulas propositions. There are infinitely many atomic terms and complex terms are made up by Boolean operations. Where and are terms the atomic formulas have the form = ( is the same as ), Forb ( is forbidden) and Perm ( is permitted). The formulae are truth functional combinations of these. An algebraic and a model theoretic account of validity are given and an axiomatic system is provided for which they are characteristic.The closure principle, that what is not forbidden is permitted is shown to hold at the level of outcomes but not at the level of events. In the two final sections some other operators are considered and a semantics in terms of action games.     

Detachment and defeasibility in deontic logic

The purpose of the paper is to present a logical framework that allow to formalize a kind of prima facie duties, defeasible conditional duties, indefeasible conditional duties and actual (indefeasible) duties, as well as to show their logical interconnections.     

Some independence results in interpretability logic

A Kripke-style semantics developed by de Jongh and Veltman is used to investigate relations between several extensions of interpretability logic, IL.     

Expressivity results for deontic logics of collective agency

We use a deontic logic of collective agency to study reducibility questions about collective agency and collective obligations. The logic that is at the basis of our study is a multi-modal logic in the tradition of stit (‘sees to it that’) logics of agency. Our full formal language has constants for collective and individual deontic admissibility, modalities for collective and individual agency, and modalities for collective and individual obligations. We classify its twenty-seven sublanguages in terms of their expressive power. This classification enables us to investigate reducibility relations between collective deontic admissibility, collective agency, and collective obligations, on the one hand, and individual deontic admissibility, individual agency, and individual obligations, on the other.

     

A new semantical approach to the logic of preference

A possible world semantics for preference is developed. The remainder operator () is used to give precision to the notion that two states of the world are as similar as possible, given a specified difference between them. A general structure is introduced for preference relations between states of affairs, and three types of such preference relations are defined. It is argued that one of them, actual preference, corresponds closely to the concept of preference in informal discourse. Its logical properties are studied and shown to be plausible.     

Combinations of tense and deontic modality: On the approach to temporal logic with historical necessity and conditional obligation

We consider three infinite hierarchies of what I call “two-dimensional temporal logics with explicit realization operators”, viz. (i) one without historical or deontic modalities, (ii) one with historical but without deontic modalities, and (iii) one with historical and with dyadic deontic modalities for conditional obligation and permission. Sound and complete axiomatizations are obtained for all three hierarchies relative to a simplified version of the finite co-ordinate-system semantics given for so-called T × W logic of historical necessity in [L. Åqvist, The logic of historical necessity as founded on two-dimensional modal tense logic, J. Philos. Logic 28 (1999) 329–369].     

Syntactical results on the arithmetical completeness of modal logic

In this paper the PA-completeness of modal logic is studied by syntactical and constructive methods. The main results are theorems on the structure of the PA-proofs of suitable arithmetical interpretationsS of a modal sequentS, which allow the transformation of PA-proofs ofS into proof-trees similar to modal proof-trees. As an application of such theorems, a proof of Solovay's theorem on arithmetical completeness of the modal system G is presented for the class of modal sequents of Boolean combinations of formulas of the form p _i,m _i=0, 1, 2, ... The paper is the preliminary step for a forthcoming global syntactical resolution of the PA-completeness problem for modal logic.