Solutions to Exercises from Session 2 and some new Puzzles
Exercise from Session 2
Anderson proposed to utilize a violation constant v to express or define an obligation operator:1
- OA is defined by ¬A⇒v: A is obliged if ¬A leads to violation.
We have not given a precise meaning to ⇒ yet. Anderson had in mind an implication from the family of relevance logics. In the literature it has often been proposed to use strict implication instead (also since it has a comparably simple logical model):
- OA is defined by ◻(¬A→v): A is obliged if ¬A necessarily leads to violation.
Permission can then be defined by:
- PA is defined by ◊(A∧¬v): A is permissible if it is possible that A and at the same time no violation takes place.
The necessity modality ◻ may be the modality from the modal logic K or T. In both logics, just like in SDL, a model is a quadruple M=⟨W,R,@,v⟩ with a non-empty set of worlds W, an accessibility relation R among worlds, an actual world @∈W and an interpretation of atoms at worlds v. For K there are no restrictions on R, while for T, R is reflexive, i.e., for all worlds w∈W, wRw. We have one special requirement for v that every model and every world has to fulfill: there is always an accessible world without violation.
- For all w∈W there is a w′∈W for which wRw′ and M,w′⊨¬v.
Note that this requirement implies that the accessibility relation will be serial, just like in SDL.
Formulas at worlds are interpreted just as in SDL, where
- M,w⊨◻A (“it is necessary that A") iff for all w′ for which wRw′, M,w′⊨A.
- M,w⊨◊A (“it is possibly that A") iff there is an w′ for which wRw′ and M,w′⊨A.
Try to verify that the following principles of SDL are also valid in Anderson’s systems based on K and T (at every world in every model):
- Op→Pp
- (Op∧Oq)→O(p∧q)
Show that additionally we get:
- ◻p→Op
- ◻(p→q)→(Op→Oq) (Note the similarly to O-Inh.)
- and where R is reflexive: O(Op→p).
Extra question: in your opinion, in what sense (if any) does Anderson’s system give a “reduction” of deontic logic to alethic modal logic, and in what sense (if any) not?
Solution to the Exercise from Session 2
Op→Pp
The formula holds in every model of Anderson’s system (in every world). To see this suppose M=⟨W,R,@,v⟩ is an abitrary model and w∈W. To show that Op→Pp we consider two cases:
- M,w⊨Op. Thus, M,w⊨◻(¬p→v). Note that since ◊¬v holds in every world, M,w⊨◊¬v. Hence, there is a world w′ for which wRw′ and M,w′⊨¬v. Since M,w⊨◻(¬p→v) and wRw′, also M,w′⊨¬p→v. By Modus Tollens, M,w′⊨p. Hence, M,w⊨◊(p∧¬v) and hence M,w⊨Pp. Altogether, M,w⊨Op→Pp.
- M,w⊨¬Op. But then M,w⊨Op→Pp.
Altogether, in any case, M,w⊨Op→Pp. Since M and w were arbitrary, our proof is finished.
(Op∧Oq)→O(p∧q)
The formula holds in every model of Anderson’s system (in every world). To see this suppose M=⟨W,R,@,v⟩ is an abitrary model and w∈W. We again consider two cases:
-
M,w⊨Op∧Oq. Thus, M,w⊨◻(¬p→v) and M,w⊨◻(¬q→v). Now let w′ be any world for which wRw′. Thus, M,w′⊨¬p→v and M,w′⊨¬q→v. We distinguish two cases.
- M,w′⊨v. Then M,w′⊨¬(p∧q)→v.
- M,w′⊨¬v. Then M,w′⊨p and M,w′⊨q (by Modus Tollens). Thus, M,w′⊨(p∧q) and so M,w′⊨¬(p∧q)→v.
Since w′ was an arbitrary accessible world from w, M,w⊨◻(¬(p∧q)→v) and so M,w⊨O(p∧q). Thus, M,w⊨(Op∧Oq)→O(p∧q).
-
M,w⊨¬(Op∧Oq). But then M,w⊨(Op∧Oq)→O(p∧q).
Thus, in any case, M,w⊨(Op∧Oq)→O(p∧q). Since M and w were arbitrary, our proof is finished.
◻p→Op
The formula holds in every model of Anderson’s system (in every world). To see this suppose M=⟨W,R,@,v⟩ is an abitrary model and w∈W. We consider two cases:
- M,w⊨◻p. Thus, for all w′ for which wRw′, M,w′⊨p. Thus, M,w′⊨¬p→v. And so, M,w⊨◻(¬p→v), which is to say, M,w⊨Op. Thus, M,w⊨◻p→Op.
- M,w⊨¬◻p. But then M,w⊨◻p→Op.
Thus, in any case, M,w⊨◻p→Op. Since M and w were arbitrary, our proof is finished.
◻(p→q)→(Op→Oq)
The formula holds in every model of Anderson’s system (in every world). To see this suppose M=⟨W,R,@,v⟩ is an abitrary model and w∈W. We consider two cases:
- M,w⊨◻(p→q). Let w′ be an arbitrary world for which wRw′. Thus, M,w′⊨p→q. We have to show that M,w⊨Op→Oq. If M,w⊨¬Op we immediately get M,w⊨Op→Oq. Suppose M,w⊨Op. Thus, M,w⊨◻(¬p→v). Thus, M,w′⊨¬p→v. We consider two cases:
- M,w′⊨p. Thus, by Modus Ponens, M,w′⊨q and thus M,w′⊨¬q→v.
- M,w′⊨¬p. Thus, by Modus Ponens, M,w′⊨v and thus M,w′⊨¬q→v.
- M,w⊨¬◻(p→q). But then M,w⊨◻(p→q)→(Op→Oq).
Thus, in any case, M,w⊨◻(p→q)→(Op→Oq). Since M and w were arbitrary, our proof is finished.
O(Op→p) (where R is reflexive)
The formula holds in every model of Anderson’s system (in every world) with reflexive accessibility relation. To see this suppose M=⟨W,R,@,v⟩ is an abitrary model and w∈W.
Assume for a contradiction that M,w⊨¬O(Op→p).
- Thus, M,w⊨¬◻(¬(Op→p)→v).
- Thus, there is a world w′ for which wRw′ and M,w′⊨¬(¬(Op→p)→v).
- Hence, M,w′⊨¬(Op→p) and M,w′⊨¬v.
- So, M,w′⊨Op and M,w′⊨¬p.
- So, M,w′⊨◻(¬p→v).
- Since R is reflexive, w′Rw′ and so M,w′⊨¬p→v.
- By Modus Ponens, M,w′⊨v, but this is a contradiction (with line 3).
So for all worlds w∈W, M,w⊨O(Op→p).
New Puzzles
The following are a bit harder puzzles for the courageous.
-
We have just shown that O(Op→p) holds in Anderson’s system with reflexive accessibility relation. Does it hold in SDL? If yes, give an argument. If no, find a counter-model.
-
What about OOp→Op?
-
In view of the distribution principle
- O(p→q)→(Op→Oq)
O(Op→p) implies OOp→Op. Do you see how this is so?
-
Is there an SDL models where OOp→Op holds but O(Op→p) not?
-
A dual approach, not with a violation constant, but with an ideality constant, has been proposed by Stig Kanger in New foundations for ethical theory. In R. Hilpinen (Eds.), Deontic Logic: Introductory and Systematic Readings (pp. 36–58). D. Reidel Company, Dordrecht. Anderson’s approach can be found in A reduction of deontic logic to alethic modal logic. Mind, 67(265), 100–103, 1958. ↩︎