Two groups of agents, G1 and G2, face a *moral conflict* if G1 has a moral obligation and G2 has a moral obligation, such that these obligations cannot both be fulfilled. We study moral conflicts using a multi-agent deontic logic devised to represent reasoning about sentences like "In the interest of group F of agents, group G of agents ought to see to it that phi". We provide a formal language and a consequentialist semantics. An illustration of our semantics with (...) an analysis of the Prisoner’s Dilemma follows. Next, necessary and sufficient conditions are given for (1) the possibility that a single group of agents faces a moral conflict, for (2) the possibility that two groups of agents face a moral conflict within a single moral code, and for (3) the possibility that two groups of agents face a moral conflict. (shrink)

This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) its axiomatic bases), that fails to imply the proposition being eliminated. In the present paper, the authors study a broader class, including contraction functions that may be less than maximal. Specifically, they investigate "partial meet contraction functions", which are defined to yield the intersection of some nonempty family of maximal subsets of the theory that fail to imply the proposition being eliminated. Basic properties of these functions are established: it is shown in particular that they satisfy the Gardenfors postulates, and moreover that they are sufficiently general to provide a representation theorem for those postulates. Some special classes of partial meet contraction functions, notably those that are "relational" and "transitively relational", are studied in detail, and their connections with certain "supplementary postulates" of Gardenfors investigated, with a further representation theorem established. (shrink)

We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) belief revision can be analyzed by standard modal frame correspondences for model-changing operations. (shrink)

Recently, Bengt Hansson presented a paper about dyadic deontic logic,2 criticizing some purely axiomatic systems of dyadic deontic logic and proposing three purely semantical systems of dyadic deontic logic which he confidently called dyadic standard systems of deontic logic (DSDL1–3). Here I shall discuss the third by far most interesting system DSDL3 which is operating with preference relations. First, I shall describe this semantical system (Sections 1.1–1.3). Then I shall give an axiomatic system (Section 1.4) which is proved to be (...) correct (Section 2) and complete (Section 3) with respect to Hansson's semantics. Finally, in face of these results Hansson's semantics will be discussed from a more intuitive standpoint. After emphasizing its intuitive attractiveness (Section 4.1) I will show that two objections often discussed in connection with preference relations do not apply to it (Section 4.2 and 4.3); more precisely, I will show that the connectedness condition for preference relations can be dropped and that, in a sense, it is not necessary to compare two possible worlds differing in infinitely many respects. (What exactly is meant by this, will become clear later on.) Yet there is a third objection to Hansson's semantics which points to a real intuitive inadequacy of DSDL3. A way of removing this inadequacy, which corresponds to Hansson's own intuitions as well as to familiar metaethical views, is suggested, but not technically realized (Section 4.4). In the last section (section 4.5) I shall briefly show that DSDL3 is decidable, as expected. (shrink)

We discuss similarities and residual differences, within the general semantic framework of minimality, between defeasible inference, belief revision, counterfactual conditionals, updating — and also conditional obligation in deontic logic. Our purpose is not to establish new results, but to bring together existing material to form a clear overall picture.

This paper studies the properties of eight semantic consequence relations defined from a Tarski-logic L and a preference relation ≺. They are equivalent to Shoham’s so-called preferential entailment for smooth model structures, but avoid certain problems of the latter in non-smooth configurations. Each of the logics can be characterized in terms of what we call multi-selection semantics. After discussing this type of semantics, we focus on some concrete proposals from the literature, checking a number of meta-theoretic properties and elaborating on (...) their intuitive motivation. As it turns out, many of their meta-properties only hold in case ≺ is transitive. To tackle this problem, we propose slight modifications of each of the systems, showing the resulting logics to behave better at the intuitive level and in metatheoretic terms, for arbitrary ≺. (shrink)

The purpose of this paper is to explore a new deontic operator for representing what an agent ought to do; the operator is cast against the background of a modal treatment of action developed by Nuel Belnap and Michael Perloff, which itself relies on Arthur Prior's indeterministic tense logic. The analysis developed here of what an agent ought to do is based on a dominance ordering adapted from the decision theoretic study of choice under uncertainty to the present account of (...) action. It is shown that this analysis gives rise to a normal deontic operator, and that the result is superior to an analysis that identifies what an agent ought to do with what it ought to be that the agent does. (shrink)

The last section made it clear that an analysis which at first seems to fail is viable after all. It is viable if we let it depend on a partition function to be provided by the context of conversation. This analysis leaves certain traits of the partition function open. I have tried to show that this should be so. Specifying these traits as Pollock does leads to wrong predictions. And leaving them open endows counterfactuals with just the right amount of (...) variability and vagueness. (shrink)

This paper reports completeness results for dyadic deontic logics in the tradition of Hansson’s systems. There are two ways to understand the core notion of best antecedent-worlds, which underpins such systems. One is in terms of maximality, and the other in terms of optimality. Depending on the choice being made, one gets different evaluation rules for the deontic modalities, but also different versions of the so-called limit assumption. Four of them are disentangled, and compared. The main observation of this paper (...) is that, even in the partial order case, the contrast between maximality and optimality is not as significant as one could expect, because the logic remains the same whatever notion of best is used. This is established by showing that, given analogous properties for the betterness relation, the same system is sound and complete with respect to its intended modelling. The chief result of this paper concerns Åqvist’s system F supplemented with the principle of cautious monotony. It is established that, under the maximality rule, F + is sound and complete with respect to the class of models in which the betterness relation is required be reflexive and smooth . From this, a number of spin-off results are obtained. First and foremost, it is shown that a similar determination result holds for optimality; that is, under the optimality rule, F + is also sound and complete with respect to the class of models in which the betterness relation is reflexive and smooth . Other spin-off results concern classes of models in which further constraints are placed on the betterness relation, like totalness and transitivity. (shrink)