Keywords

1 Introduction

Agents may be morally lucky (Williams 1982) in several ways. Nagel (1979) explains how an agent can be morally lucky due to circumstance: if circumstances would have been different, for instance, if an agent would have had the opportunity to steal somebodies money without anybody noticing, then the agent would have done so and would have gone morally wrong. Another category is moral luck due to character, such as when an agent would have committed an immoral act of retribution in case it would be less forgiving than it actually is. But these classes of moral luck are not as interesting, in my opinion, as the class related to non-determinate outcomes of actions.Footnote 1 That is, cases where an agent is morally lucky because his agency interferes with nature or the agency of other agents in such a way that its immoral beheavior does not lead to an outcome that is considered morally bad.

If moral luck has to be taken serious as a principle of ethical reasoning, that is, if we really agree that, at least to a certain extent, lucky outcomes secure the acting agent from blame, then moral luck presents us with a problem. This problem is that moral luck conflicts with another principle of ethical reasoning, namely, that agents are not morally responsible for actions or outcomes that are not under their control. A case where this conflict between moral principles comes to the foreground, is the following variant on the well-known drinking and driving examples.

Example 1.1

In scenario 1 a man drinks 10 beers. He drives home, knows he is taking a risk, and drives very carefully. After 1 km, he is held by the police. The alcohol percentage in his blood is measured to be 0.15 %. He gets fined 300 Euros. Scenario 2 is only slightly different. A man drinks 10 beers. He drives home, knows he is taking a risk, and drives very carefully. However, now after 1 km, he fatally hits somebody crossing the road. After the accident the alcohol percentage in his blood is measured to be 0.15 %. He gets convicted for involuntary manslaughter.

If the moral responsibility in both scenarios of Example 1.1 is different, than this justifies the difference in legal treatment of the two scenarios; the view would be that driving drunk and killing somebody is morally despicable and is better than driving drunk without hitting anybody. However, the problem is that it is not clear that indeed moral responsibility is different in the two scenarios. The example is designed to make it clear that in scenario 1 and 2 both agents took the same risk; until 1 km of driving, the period in which the agents exercised their agency, the two scenarios are entirely identical. And, that the scenarios are indeed identical is to a certain extent also proven to a judge having to decide on the verdicts in both scenarios, since there is objective evidence that in both cases the percentage of alcohol was 0.15 %. So if the agency involved in both scenarios is identical, and if moral responsibility is proportional to the agency or control exercised over a situation, the conclusion should be that the moral responsibility in both scenarios is the same. The conflict is then between two principles: if we commit ourselves to the standpoint that there is a difference in moral responsibility for the two scenarios, than this difference must be linked to the different outcomes of the scenarios. So, in that case we commit ourselves to the principle of (the possibility of) moral luck. The second, conflicting principle is that agents cannot be morally responsible for what is not under their control, which implies that, given their set-up, there should not be a difference in assignment of moral responsibility between the two scenarios.

In this article, in Sects. 4, 5 and 6, I will defend the standpoint that moral luck with respect to action outcomes, as described above, does not exist. I will then explain the difference in legal treatment of the two scenarios as resulting from differences between the legal and the moral evaluation of actions: in a moral evaluation they are identical, in a legal evaluation they are not. After all, legal responsibility is not the same as moral responsibility. A father can be legally responsible for wrongdoings of his children without being morally responsible for these same wrongdoings. Or a company can be legally responsible for polluting the environment without being morally responsible (because it is not clear at all if moral responsibility can be lifted to groups or organisations of agents). The problem with this ‘way out’ is that it raises the question of how much moral and legal responsibility can diverge. It is clear that legal responsibility always reflects at least some underlying level of moral responsibility. First of all, our laws cannot be too different from what people belief to be morally justified, otherwise our social choice mechanisms will correct them. Second, to a certain extent the father is morally responsible, since in a remote way, being responsible for their upbringing, his children’s acts derive from his own acts. And the company is maybe also morally responsible in some derived sense since somehow the company’s acts are acts of the agents working for the company. These observations ask for clarification, the kind of clarification that in my opinion can best be provided by formalisation.

Before explicating the goal of this paper further, I want to take away a possible misconception. The described problem with moral luck is mostly seen as conflicting with Kantian ethics. Kantian ethics links morality to the action and not to its outcome. So, if in practice we assign morality to outcomes instead of actions, as we seem to do in many cases, we are operating in conflict with Kantian ethics. It might seem that we have to conclude that our practice of assigning morality to outcomes is an argument in favour of consequentialist ethics. However, that would be too hasty a conclusion. Moral luck is just as much a problem for consequentialist ethics as it is for Kantian ethics. Consequentialist ethics takes the position that badness of acts derives from the badness of their outcomes. But this dependency on the status of outcomes does not transfer to cases where outcomes are uncertain, that is, to cases where moral luck can be involved. For instance, a consequentialist can argue that his killing is justified or even the good thing to do if it safes more lives than it costs. Now also for the ethical reasoning in judging this consequentialist killer moral luck poses a problem, since if it turns out that this agent’s killing does not safe the lives of several others, the moral luck (in this case moral misfortune) phenomenon will raise its head and the killer will have a hard time justifying his killing. That is, the killing agent is likely to be judged for the unlucky outcome even though before the killing he was correct to expect that his act would safe more lives than it would cost and was therefore, according to his consequentialist ethical reasoning, the good thing to do.

I strongly belief that we can get a much clearer picture of the situation by giving fomalizations of agency, failure, attempt, negligence and (normative) luck. So this is what I aim to do in this paper. In order to formalize luck in a normative context, we should resolve three core issues. We need:

  1. 1.

    a way to represent indeterminacy of action

  2. 2.

    a way to express the determination of an agent (risk avoidance, risk taking, negligent acting or refraining, attempt, etc.)

  3. 3.

    a way to represent the moral or legal value of an act relative to some (implicit) normative code.

The first problem we solve by resorting to probabilistic stit (Broersen 2011c). In this form of stit theory, effects of choices are no longer guaranteed but are obtained with a certain probability. The second problem we solve by endowing the probabilistic stit operators with lower bounds on the chance of success and by defining attempt as a maximization of the chance of success (Broersen 2011a). Finally, the third problem is tackled by introducing violation constants in this context (Anderson 1958; Broersen 2011b). If a violation occurs, an agent does not behave according to some moral or legal code that, in this paper, is not made explicit. We can see the paper then as a combination of the ideas put forward in Broersen (2011a, b, c). We will present essential parts of the material from those papers here and then discuss the application to the formalization of moral and legal luck.

2 Modeling Indeterminacy of Action

In the following two sub-sections we first introduce the base stit logic and then extend this logic to allow for non-determinate effects.

2.1 Determinate Action: \(\mathsf {{ XSTIT}}^{p}\)

In this section we define the base logic, which is a variant of the logic \(\mathsf {XSTIT}\) that we call \(\mathsf {XSTIT}^{p}\) (Broersen 2013). The difference with \(\mathsf {XSTIT}\) is embodied by an axiom schema concerning modality-free propositions \(p\), which explains the name. The semantics uses \(h\)-relative effectivity functions, which specialize the notion of effectivity function from Coalition Logic (Pauly 2002) by defining choices relative to histories.

Definition 2.1

Given a countable set of propositions \(P\) and \(p \in P\), and given a finite set \(Ags\) of agent names, and \(ag \in Ags\), the formal language \(\mathcal L_\mathsf{XSTIT ^{p}}\) is:

$$ \begin{array}{lcl} \varphi \!\!\!\!\!\! &{} := &{} p \mid \lnot \varphi \mid \varphi \wedge \varphi \mid \Box \varphi \mid [ag \; \mathtt {xstit}] \varphi \mid X \varphi \\ \end{array} $$

Besides the usual propositional connectives, the syntax of \(\mathsf {XSTIT}^{p}\) comprises three modal operators. The operator \(\Box \varphi \) expresses ‘historical necessity’, and plays the same role as the well-known path quantifiers in logics such as \(\mathsf {CTL}\) and \(\mathsf {CTL}^*\) (Emerson 1990). Another way of talking about this operator is to say that it expresses that \(\varphi \) is ‘settled’. We abbreviate \(\lnot \Box \lnot \varphi \) by \(\Diamond \varphi \). The operator \([ag \; \mathtt {xstit}] \varphi \) stands for ‘agent \(ag\) sees to it that \(\varphi \) in the next state’. We abbreviate \(\lnot [ag \; \mathtt {xstit}] \lnot \varphi \) by \(\langle ag \; \mathtt {xstit} \rangle \varphi \). The third modality is the next operator \(X \varphi \). It has a standard interpretation as the transition to a next state.

Definition 2.2

An \(\mathsf XSTIT ^{p}\)-frame is a tuple \(\langle S, H, E \rangle \) such thatFootnote 2:

  1. 1.

    S is a non-empty set of static states. Elements of S are denoted s, s’, etc.

  2. 2.

    \(H\) is a non-empty set of ‘backwards bundled’ histories. A history \(h \in H\) is a sequence \(\ldots s, s', s'' \ldots \) of mutually different elements from \(S\). To denote that \(s'\) succeeds \(s\) on \(h\) we use a successor function \(succ\) and write \(s' = succ(s,h)\). The following constraint on the set \(H\) ensures that if different histories share a state, they are bundled together in the past direction:

    1. a.

      if \(s = succ(s',h)\) and \(s = succ(s'',h')\) then \(s' = s''\)

  3. 3.

    \(E: S \times H \times Ags \mapsto 2^{S}\) is an \(h\)-effectivity function yielding for an agent \(ag\) the set of next static states allowed by the choice exercised by the agent relative to a history. We have the following constraints on \(h\)-effectivity functions:

    1. a.

      if \(s \not \in h\) then \(E(s,h,ag) = \emptyset \)

    2. b.

      if \(s' \in E(s,h,ag)\) then \(\exists h': s' = succ(s,h')\)

    3. c.

      if \(s' = succ(s,h')\) and \(s' \in h\) then \(s' \in E(s,h,ag)\)

    4. d.

      \(E(s,h,ag_1) \cap E(s,h',ag_2) \not = \emptyset \) for \(ag_1 \not = ag_2.\)

In Definition 2.2 above, we refer to the states \(s\) as ‘static states’. This is to distinguish them from ‘dynamic states’, which are combinations \(\langle s,h \rangle \) of static states and histories. Dynamic states function as the elementary units of evaluation of the logic. This means that the basic notion of ‘truth’ in the semantics of this logic is about dynamic conditions concerning choices. This distinguishes stit from logics like Dynamic Logic and Coalition Logic whose central notion of truth concerns static conditions holding for static states.

The name ‘h-effectivity functions’ for the functions defined in item 3 above is short for ‘h-relative effectivity functions’. This name is inspired by similar terminology in Coalition Logic whose semantics is in terms of ‘effectivity functions’. Condition 3.a above states that h-effectivity is empty for history-state combinations that do not form a dynamic state. Condition 3.b ensures that next state effectivity as seen from a current state \(s\) does not contain states \(s'\) that are not reachable from the current state through some history. Condition 3.c expresses the well-known stit condition of ‘no choice between undivided histories’. Condition 3.d above states that simultaneous choices of different agents never have an empty intersection. This represents a constraint on the independence of choices by different agents.

Figure 1 visualizes a frame of the type defined by Definition 2.2. The columns in the games forms linked to each state are the choices of agent \(ag_1\) and the rows are the choices of agent \(ag_2\). Independence of choices is reflected by the fact that the game forms contain no ‘holes’ in them. Choice taking in this ‘bundled’ semantics is thought of as the separation of two bundles of histories: one bundle ensured by the choice exercised and one bundle excluded by that choice. The pictures of the frames suggest more constraints than are actually specified by Definition 2.2. For instance, the technical definition of the frames does not exclude that the choices of an agent \(ag\) are mutually disjoint. However, since they result in much tidier pictures, in the visualizations of the frames we assume such conditions.

Fig. 1
figure 1

Visualization of a partial two agent \(\mathsf {XSTIT}^{p}\) frame

We now define models by adding a valuation of propositional atoms to the frames of Definition 2.2. We impose that all dynamic states relative to a static state evaluate atomic propositions to the same value. This reflects the intuition that atoms, and modality-free formulas in general do not represent dynamic information. Their truth value should thus not depend on a history but only on the static state. This choice does however make the situation non-standard. It is a constraint on the models, and not on the frames.

Definition 2.3

A frame \(\mathcal F = \langle S, H, E \rangle \) is extended to a model \(\mathcal M = \langle S, H, E, V \rangle \) by adding a valuation \(V\) of atomic propositions:

  • \(V\) is a valuation function \(V: P \longrightarrow 2^{S}\) assigning to each atomic proposition the set of static states relative to which they are true.

We evaluate truth with respect to dynamic states built from a dimension of histories and a dimension of static states.

Definition 2.4

Relative to a model \(\mathcal M = \langle S, H, E, V \rangle \), truth \(\mathcal \langle s, h \rangle \models \varphi \) of a formula \(\varphi \) in a dynamic state \(\langle s, h \rangle \), with \(s \in h\), is defined as:

$$ \begin{array}{lll} \mathcal \langle s, h \rangle \models p &{} \Leftrightarrow &{} s \in V(p) \\ \mathcal \langle s, h \rangle \models \lnot \varphi &{} \Leftrightarrow &{} \text{ not } \mathcal \langle s, h \rangle \models \varphi \\ \mathcal \langle s, h \rangle \models \varphi \wedge \psi &{} \Leftrightarrow &{} \mathcal \langle s, h \rangle \models \varphi \text{ and } \mathcal \langle s, h \rangle \models \psi \\ \mathcal \langle s, h \rangle \models \Box \varphi &{} \Leftrightarrow &{} \forall h': \text{ if } s \in h' \text{ then } \mathcal \langle s, h' \rangle \models \varphi \\ \mathcal \langle s, h \rangle \models X \varphi &{} \Leftrightarrow &{} \text{ if } s' = succ(s,h) \text{ then } \mathcal \langle s', h \rangle \models \varphi \\ \mathcal \langle s, h \rangle \models [ag \; \mathtt {xstit}] \varphi &{} \Leftrightarrow &{} \forall s',h': \text{ if } s' \in E(s,h,ag) \text{ and } \\ &{}&{} s' \in h' \text{ then } \mathcal \langle s', h' \rangle \models \varphi \\ \end{array} $$

Satisfiability, validity on a frame and general validity are defined as usual.

Note that the historical necessity operator quantifies over one dimension, and the next operator over the other. The stit modality combines both dimensions. Now we proceed with the axiomatization of the base logic.

Fig. 2
figure 2

Visualization of a partial two agent \(\mathsf {XSTIT}^{p}\) model

Figure 2 gives an example model that we can use to discuss the evaluation of formulas. Relative to static state \(s_1\) and the history \(h_5\) that is part of the bundle of histories \(Hb_5\) we do not have that the choice by agent \(ag_1\) ensures that \(\varphi \) holds, since the other agent has two choices (the bottom one and the top one) for which \(\varphi \) will not be true. So in this model we have that \(\langle s_1,h_5 \rangle \,\nvDash \, [ag_1 \; \mathtt {xstit}] \varphi \). However, relative to, for instance, a history in the bundle \(Hb_1\), the agent \(ag_1\) does guarantee that \(\varphi \) obtains as the result of the choice it excerts independent of what agent \(ag_2\) choses simultaneously: for all three choices of the other agent \(\varphi \) is the result. So we have that \(\langle s_1,h_1 \rangle \models [ag_1 \; \mathtt {xstit}] \varphi \).

Definition 2.5

The following axiom schemas, in combination with a standard axiomatization for propositional logic, and the standard rules (like necessitation) for the normal modal operators, define a Hilbert system for \(\mathsf XSTIT ^{p}\):

$$ \begin{array}{ll} \text{(p) } &{} p \rightarrow \Box p \; \; \text{ for } p \text{ modality } \text{ free } \\ &{} \text{ S5 } \text{ for } \Box \\ \text{(D) } &{} \lnot [ag \; \mathtt {xstit}] \bot \\ \text{(Lin) } &{} \lnot X \lnot \varphi \leftrightarrow X \varphi \\ \text{(Sett) } &{} \Box X \varphi \rightarrow [ag \; \mathtt {xstit}] \varphi \\ \text{(XSett) } &{} [ag \; \mathtt {xstit}] \varphi \rightarrow X \Box \varphi \\ \text{(Agg) } &{} [ag \; \mathtt {xstit}] \varphi \wedge [ag \; \mathtt {xstit}] \psi \rightarrow [ag \; \mathtt {xstit}] (\varphi \wedge \psi ) \\ \text{(Mon) } &{} [ag \; \mathtt {xstit}] (\varphi \wedge \psi ) \rightarrow [ag \; \mathtt {xstit}] \varphi \\ \text{(Dep) } &{} \Diamond [ag_1 \; \mathtt {xstit}] \varphi \wedge \ldots \wedge \Diamond [ag_n \; \mathtt {xstit}] \psi \rightarrow \\ &{} \Diamond ([ag_1 \; \mathtt {xstit}] \varphi \wedge \ldots \wedge [ag_n \; \mathtt {xstit}] \psi ) \\ &{} \text{ for } Ags = \{ ag_1, \ldots , ag_n \} \\ \end{array} $$

Theorem 2.1

(Broersen 2011b) The Hilbert system of Definition 2.5 is complete with respect to the semantics of Definition 2.4.

2.2 Action with Non-Determinate Effect: XSTIT.Prob

The stit logic of the previous section was based on the idea of acting as ensuring a certain condition. In the present section we put forward a theory that relaxes this assumption. Now actions are no longer necessarily successful. We are going to assume we measure success of action against an agent’s beliefs about the outcome of its choice. So, the perspective is an internal, subjective one, and the criterion of success is formed by an agent’s beliefs about its action. To represent these beliefs we choose here to use probabilities. In particular, we will represent beliefs about simultaneous choices of other agents in a system as subjective probabilities. Several choices have to be made. We will assume that an agent can never be mistaken about its own choice, but that it can be mistaken about choices of others. The actual action performed results from a simultaneous choice of all agents in the system. Then, if an agent can be mistaken about the choices of other agents (including possibly an agent with special properties called ‘nature’), the action can be unsuccessful.

We introduce operators \([ag \; \mathtt {xstit}^{\ge c}] \varphi \) with the intended meaning that agent \(ag\) exercises a choice for which it believes to have a chance of at least \(c\) of bringing about \(\varphi \). We assume that numbers \(c\) are between 1 and 0 and that the set of possible c’s is at least countable (that is, a subset of \(\mathrm {I\!\!Q}\)). Roughly, the semantics for this new operator is as follows. We start with the multi-agent stit-setting of the previous section. Now to the semantic structures we add functions such that in the little game-forms, as visualized by Fig. 1, for each choice of an agent \(ag\) we have available the subjective probabilities applying to the simultaneous choices of other agents in the system. For an agent \(ag\) the sum of the probabilities over the choices of each particular other agent in the system adds up to one. So, the probabilities represent agent \(ag\)’s beliefs concerning what choices are exercised simultaneously by other agents. We use this subjective probability function to define for each choice the change of success to obtain a condition \(\varphi \): relative to the choice we add up the probabilities for each of the choices of all other agents in the system leading to a situation obeying \(\varphi \).

For the definition of the probabilistic frames, we first define an augmentation function returning the choices a group of agent has in a given state.

Definition 2.6

The range function \(Range: S \times Ags \mapsto 2^{2^S \setminus \emptyset } \setminus \emptyset \) yielding for a state \(s\) and an agent \(ag\), the choices this agent has in \(s\) is defined as:

\(Range(s,ag) = \{Ch \mid \exists h: s \in h \text{ and } Ch = E(s,h,ag)\}\)

A range function is similar to what in Coalition Logic (Pauly 2002) is called an ‘effectivity function’. Now we are ready to define the probabilistic stit frames.

Definition 2.7

A probabilistic \(\mathsf XSTIT ^{p}\)-frame is a tuple \(\langle S, H, E, B \rangle \) such that:

  1. 1.

    \(\langle S, H, E \rangle \) is an \(\mathsf XSTIT ^{p}\)-frame

  2. 2.

    \(B: S \times Ags \times Ags \times 2^{S} \mapsto [0,1]\) is a subjective probability function such that \(B(s, ag_1, ag_2, Ch)\) expresses agent 1’s belief that in static state \(s\) agent 2 performs a choice resulting in one of the static states in \(Ch\). We apply the following constraints.

    1. a.

      \(B(s,ag,ag',Ch) = 0\) if \(ag \not = ag'\) and \(Ch \not \in Range(s,ag')\)

    2. b.

      \(B(s, ag, ag', Ch) > 0\) if \(ag \not = ag'\) and \(Ch \in Range(s,ag')\)

    3. c.

      \(\sum \limits _{Ch \in Range(s,ag')} B(s, ag, ag', Ch) = 1\) if \(ag \not = ag'\)

    4. d.

      \(B(s, ag, ag, Ch) = 1.\)

The conditions in Definition 2.7 are variations on the Kolmogorov axioms for probability. Condition 2.a says that agents only assign non-zero subjective probabilities to choices other agents objectively have. Condition 2.b says these probabilities are strictly larger than zero. Condition 2.c says that the sum of the subjective probabilities over the possible choices of other agents add up to 1. Condition 2.d says that agents always know what choice they exercise themselves. We may call this property the ‘free will’ property. In an objective view on the choices of an agent, the probabilities for the choices in the agent’s repertoire have to add up to 1. From such an objective view point for each of the possible choices we get a chance somewhere between 0 and 1, and the standard Kolmogorov conditions apply. But from the perspective of the agent itself, that is, from the subjective viewpoint taken in this logic, the standard conditions do not apply. Conditional on what choice an agent actually takes, we can say that subjectively, the agent is 100 % sure about what choice it is taking. And at the same time it has the free will to take any of the choices open to him/her. No agent would regard its own choice taking as a matter of chance: it has the free will to choose and if it chooses something it is 100 % sure about the fact that it is taking that choice. That is what free will demands. So from a subjective viewpoint and taking into account the free will of the agents, we have reason to violate the third Kolmogorov axiom and allow for the possibility that an agent’s subjective probabilities concerning its own possibilities for taking choices add up to infinity (if the number of choices is infinite).Footnote 3

Fig. 3
figure 3

Visualization of a partial two agent probabilistic \(\mathsf {XSTIT}^{p}\) model

Figure 3 extends the earlier example model with subjective probabilities for agent \(ag_1\)’s belief concerning the choice agent \(ag_2\) exercises simultaneously. We see that agent \(ag_1\) beliefs the the chance that agent \(ag_2\) chooses the top row is 0.6, that the chance for the middle row is 0.3 and the chance for the bottom row is 0.1. It is easy to check that this model satisfies all the conditions discussed above.

In the sequel we will need an augmentation function yielding for an agent and an arbitrary next static state the chance an agent ascribes to the occurrence of this state (given its belief, i.e., subjective probabilities about simultaneous choice taking of other agents). For this, we first need the following proposition. To guarantee that the proposition is true, we need the extra condition that choices do not overlap, which we can safely add to the semantics.

Proposition 2.2

For any pair of static states \(s\) and \(s'\) for which there is an \(h\) such that \(s' = succ(s,h)\) there is a unique ‘choice profile’ determining for each agent \(ag\) in the system a unique choice \(Ch = E(s,h,ag)\) relative to \(s\) and \(s'\).

Now we can define the subjective probabilities agents assign to possible system outcomes. Because of the idea of independence of choices, we can multiply the chances for the choices of the individual agents relative to the system outcome (the resulting static state). Note that this gives a new and extra dimension to the notion of (in)dependence that is not available in standard stit theories.Footnote 4

Definition 2.8

\(BX: S \times Ags \times S \mapsto [0,\,1]\) is a subjective probability function concerning possible next static states, defined by

$$ \begin{array}{ll} BX(s,\, ag,\, s') = \prod \limits _{ag' \in Ags} B(s,\, ag,\, ag', E(s,\,h,\,ag')) \text{ with } s' = succ(s,\,h) \text{ for } \text{ some } h \end{array}$$

Note that \(BX(s,\, ag,\, s')\) expresses agent \(ag\)’s belief in state \(s\) that its choice ends up in \(s'\) modulo the assumption that \(ag\) actually chooses such as to make \(s'\) a possible outcome; if \(ag\) chooses such that \(s'\) is excluded by its choice, the chance for \(s'\) is of course 0.

Now before we can define the notion of ‘seeing to it under a minimum bound on the probability of success’ formally as a truth condition on the frames of Definition 2.7 we need to do more preparations. First we assume that the intersection of the h-effectivity functions of all agents together yields a unique static state. We can safely assume this, because this condition is not modally expressible. This justifies Definition 2.9 below, that establishes a function characterizing the static states next of a given state that satisfy a formula \(\varphi \) relative to the current choice of an agent.

Definition 2.9

The ‘possible next static \(\varphi \)-states’ function \(PosX: S \times H \times Ags \times \mathcal {L} \mapsto 2^S\) which for a state \(s\), a history \(h\), an agent \(ag\) and a formula \(\varphi \) gives the possible next static states obeying \(\varphi \) given the agent’s current choice determined by \(h\), is defined by: \(PosX(s,h,ag,\varphi ) = \{s' \mid s' \in E(s,h,ag) \text{ and } \mathcal \langle s', h' \rangle \models \varphi \text{ for } \text{ all } h' \text{ with } s' \in h' \}\).

Now we can formulate the central ‘chance of success’ (CoS) function that will be used in the truth condition for the new operator. The chance of success relative to a formula \(\varphi \) is the sum of the chances the agent assigns to possible next static states validating \(\varphi \).

Definition 2.10

The chance of success function \(CoS: S \times H \times Ags \times \mathcal {L} \mapsto [0,1]\) which for a state \(s\) and a history \(h\) an agent \(ag\) and a formula \(\varphi \) gives the chance the agent’s choice relative to \(h\) is an action resulting in \(\varphi \) is defined by: \(CoS(s,h,ag,\varphi ) = 0\) if \(PosX(s,h,ag,\varphi ) = \emptyset \) or else \(CoS(s,h,ag,\varphi ) = \sum \limits _{s' \in PosX(s,h,ag,\varphi )} BX (s,ag,s')\).

Extending the probabilistic frames of Definition 2.7 to models in the usual way, the truth condition of the new operator is defined as follows.

Definition 2.11

Relative to a model \(\mathcal M = \langle S, H, E, B, V \rangle \), truth \(\mathcal \langle s, h \rangle \models [ag \; \mathtt {xstit}^{\ge c}] \varphi \) of a formula \([ag \; \mathtt {xstit}^{\ge c}] \varphi \) in a dynamic state \(\langle s, h \rangle \), with \(s \in h\), is defined as:

$$ \begin{array}{l} \mathcal \langle s, h \rangle \models [ag \; \mathtt {xstit}^{\ge c}] \varphi \Leftrightarrow CoS(s, h, ag, \varphi ) \ge c \\ \end{array} $$

Using the example model of Fig. 3 we can now discuss truth evaluations on probabilistic stit models. As we saw earlier, relative to static state \(s_1\) and the history \(h_5\) that is part of the bundle of histories \(Hb_5\) we do not have that the choice by agent \(ag_1\) ensures that \(\varphi \) holds, since the other agent has two choices (the bottom one and the top one) for which \(\varphi \) will not be true. So in this model we have that \(\langle s_1,h_5 \rangle \nvDash \, [ag_1 \; \mathtt {xstit}^{\ge 1}] \varphi \). But we do have that \(\langle s_1,h_5 \rangle \models [ag_1 \; \mathtt {xstit}^{\ge 0.3}] \varphi \) since \(ag_1\) believes that with a chance of 0.3 agent \(ag_2\) exercises the choice of the middle row. But, relative to histories in, for instance the bundle \(Hb1\), agent \(ag_1\) has better chances to see to it that \(\varphi \) will be true. In particular we have that \(\langle s_1,h_1 \rangle \models [ag_1 \; \mathtt {xstit}^{\ge 0.4}] \varphi \), because it can add up the chances of the bottom two rows. Note that this is also true relative to the histories in bundle \(Hb_3\) for which the result is \(\lnot \varphi \). Here we have a situation where the agent saw to it that \(\varphi \) with a chance of success of at least 0.4, but failed. Also note that situations like these show that it is consistent in the logic to have, for instance, that \([{a g_1} \; \mathtt {xstit}^{\ge \ c}] \varphi \wedge [{ag_2} \; \mathtt {xstit}^{\ge \ c}] \lnot \varphi \), that is, if \(c\) is not 1.

The probabilistic stit operator we gave in Definition 2.11 faithfully generalizes the stit operator of our base \(\mathsf {XSTIT}^{p}\) system: the objective stit operator \([ag \; \mathtt {xstit}] \varphi \) discussed in Sect. 2.1 comes out as the probabilistic stit operator assigning a probability 1 to establishing the effect \(\varphi \). This is very natural. Where in the standard stit setting we can talk about ‘ensuring’ a condition, in the probabilistic setting we can only talk about establishing an effect with a certain lower bound on the probability of succeeding.

We now give a Hiblert system for the probabilistic stit logic. The system is parametric is probabilistic variables \(c\) and \(k\). This means that the system encodes infinitely many axioms, since there can be infinitely many values for \(c\) and \(k\). To obtain a standard Hilbert system we can pose a prior limit to the possible values of probabilities.

Definition 2.12

Relative to the semantics following from Definitions 2.4 and 2.11 we define the following Hilbert system. We assume all the standard derivation rules for the normal modalities \(X\) and \(\Box \). Furthermore, we assume the standard derivation rules for the weak modality \([ag \; \mathtt {xstit}^{\ge c}] \varphi \), like closure under logical equivalence.

$$ \begin{array}{ll} \text{(p) } &{} p \rightarrow \Box p \; \; \text{ for } p \text{ modality } \text{ free } \\ &{} \text{ S5 } \text{ for } \Box \\ \text{(D) } &{} \lnot [ag \; \mathtt {xstit}^{\ge c}] \bot \text{ for } c > 0 \\ \text{(Triv) } &{} [ag \; \mathtt {xstit}^{\ge 0}] \varphi \\ \text{(Lin) } &{} \lnot X \lnot \varphi \leftrightarrow X \varphi \\ \text{(Sett) } &{} \Box X \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge c}] \varphi \\ \text{(XSett) } &{} [ag \; \mathtt {xstit}^{\ge 1}] \varphi \rightarrow X \Box \varphi \\ \text{(Min) } &{} [ag \; \mathtt {xstit}^{\ge c}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge k}] \varphi \text{ for } c \ge k \\ \text{(Add) } &{} [ag \; \mathtt {xstit}^{\ge c}] \varphi \wedge [ag \; \mathtt {xstit}^{\ge k}] \psi \rightarrow [ag \; \mathtt {xstit}^{\ge c + k -1}] (\varphi \wedge \psi ) \text{ for } c + k > 1 \\ \text{(Mon) } &{} [ag \; \mathtt {xstit}^{\ge c}] (\varphi \wedge \psi ) \rightarrow [ag \; \mathtt {xstit}^{\ge c}] \varphi \\ \text{(Dep) } &{} \Diamond [ag_1 \; \mathtt {xstit}^{\ge c}] \varphi \wedge \ldots \wedge \Diamond [ag_n \; \mathtt {xstit}^{\ge k}] \psi \rightarrow \\ &{} \Diamond ([ag_1 \; \mathtt {xstit}^{\ge c}] \varphi \wedge \ldots \wedge [ag_n \; \mathtt {xstit}^{\ge k}] \psi ) \text{ for } Ags = \{ ag_1, \ldots , ag_n \} \\ \end{array} $$

Proposition 2.3

(Broersen 2011c) The Hilbert system is sound relative to the semantics.

Proposition 2.4

(Broersen 2011c) The Hilbert system reduces to the complete Hilbert system for xstit after substitution of 1 for the parameter \(c\).

Note that all axioms for xstit have a natural generalization in the above Hilbert system. The most interesting one is agglomeration that generalizes from the standard normal modal logic axiom (Agg) to the set of weak modal scheme’s (Add).

3 Modeling the Determination in Action

The second ingredient of moral luck is the determination of an agent. In particular, moral luck can be described as a moral judgement on the difference between the determination of an agent and the indeterminacy of the result of his action. We define two ways in which to represent the determination of an agent’s action. In the first sub-section we argue that the lower bounds given in the previous section already express constraints on the determination on the part of the agent. In the second sub-section we discuss the definition of attempt.

3.1 Risk in Action

Operators of the form \([ag \; \mathtt {xstit}^{\ge k}] \varphi \) to a limited extent already express determination on the part of an agent \(ag\). They express that agent \(ag\) currently performs a choice where it estimates that \(k\) is a lower bound to the probability that \(\varphi \) will obtain. Clearly, this does not model determination of the agent in the stronger sense of intentional action. But, one can say that the formula gives an ‘outer constraint’ on the determination of the agent from which some information about the agent’s intentions can be abduced. For instance, if the formula \([ag \; \mathtt {xstit}^{\ge 0.8}] p\) is true (the agent chooses an action where it beliefs the chance to achieve \(p\) is at least 0.8), while at the same time the formula \(\Diamond [ag \; \mathtt {xstit}^{\ge 0.1}] p\) is true (the agent could have chosen an action where it beliefs the chance to achieve \(p\) can be much lower) then we might explain this by abducing that the agent prefers the higher chance to see to it that \(p\). Of course, from this information we cannot deduce that it is the agent’s aim to do \(p\); that would be jumping to conclusions. But what this small example shows is that the formulas of the logic of the previous section can already be used to specify constraints on the agent’s determination. In the next section we will take this one step further by modeling the notion of ‘attempt’.

3.2 Attempt

We see an attempt for \(\varphi \) as exercising a choice that is maximal in the sense that an agent assigns the highest chance of achieving \(\varphi \) to it (Broersen 2011a). So we aim to model attempt as a comparative notion. This means, that in our formal definition for the attempt operator \([ag \; \mathtt {xatt}] \varphi \) that we introduce here, we drop the absolute probabilities. Let us first go back briefly to Fig. 3 to explain the intended semantics of attempt. We have that for agent 1, the right choice is not an attempt for \(\varphi \), since the left choice has a higher probability (0.4 vs. 0.3) of obtaining \(\varphi \). So we have that \(\langle s_1,h_5 \rangle \models X \varphi \wedge \lnot [Ag_1 \; \mathtt {xatt}] \varphi \) and \(\langle s_1,h_2 \rangle \models [Ag_1 \; \mathtt {xatt}] \varphi \). We can also see in the picture that an attempt is not necessarily successful: \(\langle s_1,h_3 \rangle \models X \lnot \varphi \wedge [Ag_1 \; \mathtt {xatt}] \varphi \).

We now give the formal definition. The truth condition for the new operator \([ag \; \mathtt {xatt}] \varphi \) is as follows.

Definition 3.1

Relative to a model \(\mathcal M = \langle S, H, E, B, \pi \rangle \), truth \(\mathcal \langle s, h \rangle \models [ag \; \mathtt {xatt}] \varphi \) of a formula \([ag \; \mathtt {xatt}] \varphi \) in a dynamic state \(\langle s, h \rangle \), with \(s \in h\), is defined as:

$$ \begin{array}{l} \mathcal \langle s, h \rangle \models [ag \; \mathtt {xatt}] \varphi \Leftrightarrow \\ \forall h': \text{ if } s \in h' \text{ then } CoS(s, h', ag, \varphi ) \le CoS(s, h, ag, \varphi ) \\ \text{ and } \\ \exists h'': s \in h'' \text{ and } CoS(s, h'', ag, \varphi ) < CoS(s, h, ag, \varphi ) \\ \end{array} $$

This truth condition explicitly defines the comparison of the current choice with other choices possible in that situation. In particular, if and only if the chance of obtaining \(\varphi \) for the current choice is higher than for the other choices possible in the given situation, the current choice is an attempt for \(\varphi \). The ‘side condition’ says that there actually must be a choice alternative with a strictly lower chance of success.

Proposition 3.1

(Broersen 2011a) Each instance of any of the following formula schemas is valid in the logic determined by the semantics of Definition 3.1.

$$ \begin{array}{lll} \text{(Cons) } &{} \lnot [ag \; \mathtt {xatt}] \bot \\ \text{(D) } &{} [ag \; \mathtt {xatt}] \lnot \varphi \rightarrow \lnot [ag \; \mathtt {xatt}] \varphi \\ \text{(Dep-Att) } &{} \Diamond [\{ag1\} \; \mathtt {xatt}] \varphi \wedge \Diamond [\{ag2\} \; \mathtt {xatt}] \psi \rightarrow \\ &{} \Diamond ([\{ag1\} \; \mathtt {xatt}] \varphi \wedge [\{ag2\} \; \mathtt {xatt}] \psi ) \\ \text{(Sure-Att) } &{} [ag \; \mathtt {xstit}] \varphi \wedge \Diamond \lnot [ag \; \mathtt {xstit}] \varphi \rightarrow \\ &{} [ag \; \mathtt {xatt}] \varphi \\ \end{array} $$

The D-axiom says that the same choice cannot be at the same time an attempt for \(\varphi \) and \(\lnot \varphi \). This is due to the presence of the ‘side condition’ in Definition 3.1. The side condition says that a choice can only be an attempt if there is at least one alternative choice with a strictly lower chance of success. Now we see immediately why the D-axiom holds: this can never be the case for complementary effects, since these have also complementary probabilities. In stit theory, side conditions are used to define ‘deliberative’ versions of stit operators (Horty and Belnap 1995). And indeed the same intuition is at work here: a choice can only be an attempt if it is ‘deliberate’.

The (Indep-Att) schema says that attempts of different agents are independent. Attempts are independent, because maximizing choice probabilities from the perspective of one agent is independent from maximizing choice probabilities from the perspective of some other agent.

Finally, the (Sure-Att) schema reveals the relation between the stit operator of our base language and the attempt operator. We saw that we can associate the operator \([ag \; \mathtt {xstit}] \varphi \) with a probabilistic stit operator with a chance of success of 1. Now, if such a choice qualifies as an attempt, it can only be that there is an alternative to the choice with a probability strictly lower than 1 (due to the side condition in Definition 3.1). In the base language we can express this as the side condition \(\Diamond \lnot [ag \; \mathtt {xstit}] \varphi \) saying that \(\varphi \) is not ensured by \(ag\)’s choice. This results in the property (Sure-Att) that says that if \(ag\) ensures \(\varphi \) with a chance of success of 1, and if \(ag\) could also have refrained (i.e., \(ag\) took a chance higher than 0 for \(\lnot \varphi \)), then \(ag\) attempts \(\varphi \). This again reveals the relation between the notion of attempt and the notion of ‘deliberate choice’ from the stit literature (Horty and Belnap 1995).

4 Moral Obligations, Prohibitions and Luck

The third ingredient of a formalization of both moral luck and legal luck is the normative aspect. In this section we will formalise obligation and prohibition in the moral sense. In the next section we do the same for obligation and prohibition in the legal sense. Adapting the approach put forward in Broersen (2011b) to the case of probabilistic action, we will use Anderson’s reduction of normative truth to logical truth (Anderson 1958) to express either the legal or the moral evaluation of the result of an action against ethical or legal normative codes. We do not explicitly represent these normative codes. However, for future research it will be interesting to investigate how moral luck might depend on the specific moral (ethical) normative code used to evaluate actions. The reduction enables us to express normative assertions about the good or bad determination in an agent’s action. We give four definitions. The first is about being morally forbidden to take a risk.

Definition 4.1

A (moral) prohibition for agent \(ag\) to perform a choice by which \(ag\) believes to take a risk of at least \(k\) to obtain \(\varphi \), denoted \(Forb_{Mor}[ag \; \mathtt {xstit}^{\ge k}] \varphi \), is defined by:

$$Forb_{Mor}[ag \; \mathtt {xstit}^{\ge k}] \varphi =_{def} \Box ([ag \; \mathtt {xstit}^{\ge k}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

The definition makes a link between action results in two different realms. The condition \(\varphi \) is an action effect in the physical realm that is subject to the moral prohibition \(Forb[ag \; \mathtt {xstit}^{\ge k}] \varphi \). The condition \(Viol\) can be thought of as an action effect in social reality (Searle 1995). The definition defines prohibition by relating the effects in both realities. In the examples below we will discuss why this formalises moral prohibition rather then legal prohibition. First we define other deontic modalities. The pattern of Definition 4.1 is repeated in the definitions below. The first is about being morally obliged to preserve a given lower bound on the chance on success. The second and third definition are about being morally forbidden and being morally obliged to attempt.

Definition 4.2

A (moral) obligation for agent \(ag\) to perform a choice by witch \(ag\) believes to have a chance of at least \(k\) to obtain \(\varphi \), denoted \(Obl_{Mor}[ag \; \mathtt {xstit}^{\ge k}] \varphi \), is defined by:

$$Obl_{Mor}[ag \; \mathtt {xstit}^{\ge k}] \varphi =_{def} \Box (\lnot [ag \; \mathtt {xstit}^{\ge k}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

Definition 4.3

A (moral) prohibition for agent \(ag\) to attempt \(\varphi \), denoted \(Forb_{Mor}[ag \; \mathtt {xatt}] \varphi \), is defined by:

$$Forb_{Mor}[ag \; \mathtt {xatt}] \varphi =_{def} \Box ([ag \; \mathtt {xatt}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

Definition 4.4

A (moral) obligation for agent \(ag\) to attempt \(\varphi \), denoted \(Obl_{Mor}[ag \; \mathtt {xatt}] \varphi \), is defined by:

$$Obl_{Mor}[ag \; \mathtt {xatt}] \varphi =_{def} \Box (\lnot [ag \; \mathtt {xatt}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

We can also make meaningful variants of the definitions where conditions \(\lnot [ag \; \mathtt {xatt}] \varphi \) are replaced by \([ag \; \mathtt {xatt}] \lnot \varphi \). The notions resulting are weaker from a normative perspective, since for these variants the agent is only in violation if it explicitly sees to the bad thing happening. For a non-probabilistic setting, nuances like these are explained in Broersen (2011b).

Note that obligations and prohibitions are moment determinate. This means that their truth value is the same for any history through a specific static state. This is due to the presence of the historical necessity operator ‘\(\Box \)’ as the first operator in all the definitions. So it is assumed here that what an agent is obliged or is forbidden does not depend on what it is doing or on what others are doing.

Fig. 4
figure 4

In state \(s_6\) the agent is lucky that \(\lnot \varphi \)

Before discussing the moral character of the prohibitions and obligations defined, let us look at some example formulas. We discuss these normative formulas by interpreting them in the model of Fig. 4, which adds violation constants to the earlier discussed model of Fig. 3. Our first example formula, which is satisfied in dynamic state \(\langle s_1,h_3 \rangle \) in Fig. 4 is \(Forb[Ag_1 \; \mathtt {xstit}^{\ge 0.4}] \varphi \wedge [Ag_1 \; \mathtt {xstit}^{\ge 0.4}] \varphi \wedge X \lnot \varphi \). The formula expresses that agent \(Ag_1\) is forbidden to choose in such a way that it believes to have a risk of at least 0.4 to obtain \(\varphi \), while at the same time agent \(Ag_1\) is actually doing such an action, but, where it is lucky since what is actually happening is that \(\lnot \varphi \) is obtained (state \(s_6\) in the model). The second example formula is very closely related. It is also satisfied in dynamic state \(\langle s_1,h_3 \rangle \) of Fig. 4. The formula is \(Forb[Ag_1 \; \mathtt {xatt}] \varphi \wedge [Ag_1 \; \mathtt {xatt}] \varphi \wedge X \lnot \varphi \) and it expresses that agent \(Ag_1\) is forbidden to attempt \(\varphi \), while at the same time that is actually what it is doing, but, where it is lucky since what is actually happening is that \(\lnot \varphi \) is obtained (again, state \(s_6\) in the model).

So, for both example formulas state \(s_6\) is a state of luck. The condition \(\varphi \) the agent according to the normative part of the formula is supposed to avoid, is indeed not true in it, but that is not due to the determination of the agent, but due to the lucky coincidence that the other agent took the top row as its choice. The agent is lucky in both example formula situations; the first formula specifies how the agent deliberately took a significant risk for \(\varphi \) and the second formula specifies how the agent even explicitly attempted \(\varphi \). So definitely, the state \(s_6\) is a state of luck. But, it is not of the moral kind. Even thought it is justified to say that the agent is lucky, there is still a violation. The violation is due to the fact that the agent exercised the wrong choice; one that went against its moral obligations or prohibitions. So, although the outcome is not bad, there is still a violation, representing that the agent was morally wrong. But if that is the interpretation, then in this setting moral luck does not exist. This observation connects to one made by Bernard Williams himself. Williams said (Williams 1993) that when he coined the term ‘moral luck’ he thought it would be an oxymoron. This formalisation represents that initial opinion; agents are not morally lucky if the outcome by coincidence is according to the moral obligations and prohibitions, because in that case there is still a moral violation.

Fig. 5
figure 5

Moral violations by the drunken driver

We are now in the position to come back to the drunken driver example. We discuss the two scenario’s of the example by relating them to the model of Fig. 5. First there are several things to explain about this model’s representation of the scenario. In the model, the middle ‘grey’ column choice is the choice taken by the driver; the choice to drive after drinking. The short hand \(hit\) stands for the driver’s car hitting a person. The short hand \(held\) stands for the driver being held by the police. Now the first important thing to be explained about the modelling of the scenarios by the pictured model concerns the chosen granularity of the actions. In the model, the exact granularity of the choices is left unspecified. Of course, the choice of the driver to take the risk and drive is not what game theorists would call a ’one shot’ action; it typically involves several choices in a row. The driving itself, that at least takes place for 1 km in the scenarios, is an action/process with duration that stretches out from the initial moment of choosing to the moment of hitting/being held by the police. It can be that during this period the agent reconsidered but saw no possibility to undo its choice, or it can be that the agent reinstated its decision, being reinforced by the idea that so far everything went smoothly. But all this is abstracted away from. Game theorists would say that the ‘extensive’ game form is normalised to a ‘normal’ game form. Actually, the possibility to look at scenarios more abstractly by normalising the situation is the big advantage of stit formalisms. If we would have to model the same scenario in a dynamic logic (Harel et al. 2000) or situation calculus (McCarthy 1963) formalism, or if we would develop a Davidsonian event-based theory (Davidson 1980), we would have to commit to some bottom level of action/event description. Stit theory, on the other hand, allows us to take any level of granularity in the description of action. And here we assume exactly the right level of description for the problem at hand.

A second modelling choice to explain are the choices of the other agents in the scenario. There are at least two other agents: a police man and the person risking being hit. In the picture we combine their choices. Actually, we will not be clear about what the exact combined choices of these two other agents are. We see that the model assigns three such choices to this sub-group (the three rows), without making explicit what combined choices they represent. In particular, we do not assign probabilities to the choices of the drunken driver as seen from the perspective of the other two agents. Without these probabilities, we cannot say much about the character of the three row choices. But that is not a problem. The example is about the choices of the drunken driver, and the choices for the drunken driver are clear. There is the right-most choice, which is the choice of avoiding being held by the police and avoiding hitting any person (maybe taking a taxi). There is the middle choice of taking the risk to be held by the police (subjective chance of \(0.4\)) and hitting a person (subjective chance of \(0.1\)). The reason the agent takes this risky choice is that he hopes to end up in state \(s_3\), that is, in the state where he reaches home without any problems. The left-most choice is one with an optimal chance of either being held by the police or hitting a person, or both. This choice is there in order to make clear that the middle choice is not one that optimises the chances of either hitting a person or being held by the police, that is, the agent does not attempt to hit a person, and does not attempt to be held by the police; it is just being negligent. A more precise model of the situation, with all relevant choices of all three involved agents explicitly represented would be much more extensive. Here we only represent the choices of the drunken driver to discuss the phenomenon of moral luck.

The question raised by the possibility of moral luck is whether or not we should judge occurrence of the situation \(s_6\) and occurrence of the situation \(s_9\) differently. In practice we seem to do that, as the drunken driver example aims to portray. If it is \(s_6\) that comes out of the agent’s choice, it is fined 300 Euro, and if it is \(s_9\) that comes out, it is convicted for manslaughter, even though both are the result of exercising the middle ‘grey’ choice in the figure, which means that the agency involved in both possibilities is exactly the same. And of course, as the model shows, the agent can be even more lucky and end up in state \(s_3\). This possibility is the reason that the agent exercises this choice in the first place. Then, in state \(s_6\), the agent is lucky and not lucky at the same time. It is lucky, because it could have ended up in state \(s_9\) which would be worse. But it is also unlucky, because it could have ended up in state \(s_3\), which would have been much better. But again we can ask the question: what kind of luck are we considering here? If it would be genuine moral luck, and if violations are moral violations, then the modelling is problematic, since our definitions demand that all three states \(s_3\), \(s_6\) and \(s_9\) are violation states. The solution I want to suggest is that there can be a justification different from a moral justification for the fact that there is a difference in the legal treatment of the different outcomes. The justification can be found by making clear the purpose of our legal systems. Before I give the argument, we will look at the formalisation of legal prohibition and obligation.

5 Legal Obligations, Prohibitions and Luck

The drunken driver example is built around the phenomenon that the legal evaluation of the different outcome states is likely to be different. Of course, the exact differences depend on the legal normative code relative to which we evaluate the outcomes. But, this will not be of our concern. Instead our concern will be the formalisation of legal obligation and prohibition. For the formal definition of the legal versions of these deontic operators we will have to consider different violation conditions. Figure 6 gives a possible model for such legal violation conditions in the drunken driver example. We see two differences with the model of Fig. 5: first, violations for the decision to drink and drive only occur if indeed the agent is either held by the police or hits a person, and second, the violations for being held and hitting a person are different, which reflects that legal systems evaluate such outcomes differently. We can now adapt Definition 4.1 and the other definitions for moral obligations and prohibitions to the legal context. The formal definitions reflect the dependency on outcomes by introducing an extra condition on effects in the normative realm (which is part of social reality), namely that the effect indeed must have occurred. This would bring us to the following characterisation of the legal prohibition to take a risk.

$$Forb_{Leg}[ag \; \mathtt {xstit}^{\ge k}] \varphi = \Box ([ag \; \mathtt {xstit}^{\ge k}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] (\varphi \rightarrow Viol))$$

However, we can use the logic to simplify this characterisation. Since the operator \([ag \; \mathtt {xstit}^{\ge 1}] \varphi \) is normal (which is not the case for other values of \(k\)), it obeys the K axiom. Furthermore, we have that \([ag \; \mathtt {xstit}^{\ge 1}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge k}] \varphi \). Using these properties we can show that the above definition, for any specific instantiation of the propositional meta-variable \(\varphi \), is equivalent to the characterisation as in the following definition.

Definition 5.1

The legal prohibition to exercise a choice for which there is a subjective risk of at least \(k\) that it has \(\varphi \) as an outcome, denoted \(Forb_{Leg}[ag \; \mathtt {xstit}^{\ge k}] \varphi \), is defined by:

$$Forb_{Leg}[ag \; \mathtt {xstit}^{\ge k}] \varphi =_{def} \Box ([ag \; \mathtt {xstit}^{\ge 1}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

Here we see how in a legal definition of prohibition that is strictly based on outcomes, the subjective element, in the context of this prohibition represented by the number \(k\), is eliminated from the definition; the only things that count are if \(\varphi \) indeed occurs and if it occurs due to the involvement of agent \(ag\). Using a similar line of reasoning we come to the following characterisation of legal obligation.

Fig. 6
figure 6

Possible legal violations by the drunken driver

Definition 5.2

The legal obligation to exercise a choice for which there is a subjective chance of at least \(k\) that it has \(\varphi \) as an outcome, denoted \(Obl_{Leg}[ag \; \mathtt {xstit}^{\ge k}] \varphi \), is defined by:

$$Obl_{Leg}[ag \; \mathtt {xstit}^{\ge k}] \varphi =_{def} \Box (\lnot [ag \; \mathtt {xstit}^{\ge 1}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] Viol)$$

For coming to definitions of ‘the legal prohibition to attempt’ and ‘the legal obligation to attempt’, we cannot assume a property like \([ag \; \mathtt {xstit}^{\ge 1}] \varphi \rightarrow [ag \; \mathtt {xatt}] \varphi \). This property does not hold, because an attempt cannot be an attempt if there is no alternative (see Proposition 3.1). This means that we cannot perform the same elimination as for the ’risk’ versions of the operators, as given above. We come to the following definitions.

Definition 5.3

The legal prohibition to attempt, denoted \(Forb_{Leg}[ag \; \mathtt {xatt}] \varphi \), and the legal obligation to attempt, denoted \(Obl_{Leg}[ag \; \mathtt {xatt}] \varphi \), are defined by:

$$Forb_{Leg}[ag \; \mathtt {xatt}] \varphi =_{def} \Box ([ag \; \mathtt {xatt}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] (\varphi \rightarrow Viol))$$
$$Obl_{Leg}[ag \; \mathtt {xatt}] \varphi =_{def} \Box (\lnot [ag \; \mathtt {xatt}] \varphi \rightarrow [ag \; \mathtt {xstit}^{\ge 1}] (\lnot \varphi \rightarrow Viol))$$

The definitions do not reflect that violations for different outcomes are different; they only reflect that a violation depends on the occurrence of a bad outcome as such. But different violations for different bad outcomes are easily added to the picture. We can work with separate violation constants for violations of separate prohibitions and obligations.

6 Discussion

The two formalizations I have given, the one of Sect. 4 and the one of Sect. 5 represent two extremes. In the formalisation of moral deontic operators in Sect. 4 violations are the result of the moral evaluation of an agent’s subjective choices. If an agent attempts something wrong, or is negligent by taking a risk, it is in violation, independent of the outcome. In the formalisation of Sect. 5 we have the other extreme: the choices themselves are not evaluated, but only their outcomes. And this reflects legal practice; legal systems cannot inspect the subjective considerations accompanying choices of agents and have to rely on outcomes. But, of course, this does not yet explain why in our example hitting a person and being held by the police are evaluated differently by the legal system while there is objective evidence (0.15 % alcohol) that the subjective risk-taking behind both scenarios is the same. There are several possible explanations for this phenomenon. The first is that legal evidence of similarity in risk taking is still ‘only’ evidence. It does not proof with 100 % certainty that the risk-taking in both situations was the same. And this means that there will always be some influence from the actual outcome on the evaluation of the level of risk-taking; we can gather as much evidence about the similarity in risk-taking as we can find, still there will always be the suspicion that in the situation where the outcome was worse, the risk-taking was higher. A second explanation for the phenomenon is that legal systems are not so much directed at the regulation of individual behaviour but at the regulation of societies of agents. Legal systems are not always fair towards individuals; they sacrifice fairness towards the individual to the general benefits of regulation for the society as a whole. It is generally felt that it gives the wrong signal to other possible offenders to let somebody who drank ten beers and fatally hits a person get away with a 300 Euro fine. And it does not make a difference if it is true that if instead this agent would have been held by the police, that same 300 Euro would have been the fine for drinking and driving. Furthermore, if specialists like police investigators, lawyers and judges will have difficulty assessing the similarity in risk taking for the two scenarios, then certainly the general public will. The society as a whole will simply demand higher penalties for outcomes that are less lucky, so that is what the laws of our legal systems reflect. Indeed, this argument ultimately boils down to the observation that our legal systems cannot avoid a certain level of scapegoat justice.

Given the observed differences between the moral and legal evaluation of actions, there is an obvious explanation for the problem introduced by the phenomenon of moral luck: our views about the moral assessment of actions are influenced and obscured by our legal views on the matter. So, if that is true, then moral luck does indeed not exist, and the luck involved in the normative assessment of outcomes is always of the legal kind. The confusions surrounding the concept of moral luck are then due to the influence of our legal views on our views on morality.

7 Conclusion

In this paper we considered a formal approach to the understanding of the problem of moral luck. We had to take three steps: (1) we had to account for indeterminacy of action effects, (2) we had to account for the determination in agentive choice, and (3) we had to define the normative evaluation of action. Luck was described as a difference between an agent’s determination (i.e., aspect 2) and the outcome of his action (i.e., aspect 1) in the light of a normative assessment of the situation (i.e., aspect 3). The first result of these efforts is a logic framework where we can reason with moral prohibitions and obligations and legal prohibitions and obligations in the context of risk taking actions. The second result is an explanation for the phenomenon of (the belief in) moral luck. Arguably we could also have found this explanation without the formalisation of the notions involved. But I think the formalisation has helped to arrive at the explanation sooner, and helps to argue for its plausibility in a more convincing way.

Several things are left to investigate. A first thing to do would be to find out what the logics are of the defined operators. But more interesting would be to relate the theory put forward here to legal theories about risk taking. For instance, an agent can go legally wrong if it takes risks a ‘normal’ person would not take. Here we see that a third form of probability is involved; the probability associated with ‘normal’ risk taking behaviour. We can then say that three forms of probability are relevant for the theory: objective probabilities, that is, likelihood information about what is objectively going on; subjective probabilities, that is, information in probabilistic form about the risks an acting agent believes to be taking; and ‘normal’ probabilities, that is, probabilistic information about the risk a normal or average person would be taking (this is best thought of as the probabilistic version of common belief). In particular the relation between the latter two forms is essential for the legal assessment of actions and their outcomes. We will have to leave this interesting subject to future research.