# On a fundamental problem of deontic logic

Tags: promulgations, condition, conjunction, vN, gross output, truth-values, net output, norms, explicit permissions, label, conditional norms, philosophical position, fundamental problem, boolean formulae, consistency check, derivation, deontic logic, obligation, consistency checks
Content: Norms, Logics and Information Systems. New Studies in Deontic Logic and Computer Science, edited by Paul McNamara and Henry Prakken (Amsterdam: IOS Press, Series: Frontiers in artificial intelligence and Applications, Volume: 49, 1999, ISBN 9051994273) pp 29-53. On a Fundamental Problem of Deontic Logic David Makinson Les Etangs B2, La Ronce, 92410 Ville d'Avray, France Email: [email protected] Abstract The usual presentations of deontic logic, whether axiomatic or semantic, treat norms as if they could bear truth-values. A fundamental problem of deontic logic, we believe, is to reconstruct it in accord with the philosophical position that norms direct rather than describe, and are neither true nor false. (Alchourrуn and Bulygin 1981) have indeed made such a construction, refining an earlier one of (Stenius 1963), based on the distinction between a norm and a proposition about norms. However it has the limitation that it does not deal with conditional norms. These are covered by an extension of (Alchourrуn 1993), but with certain shortcomings. Our purpose is to extend the basic 1981 construction in another manner which, we suggest, provides a more satisfactory and sensitive analysis of conditional norms within the same philosophical perspective. The approach takes seriously the warning: no logic of norms without attention to a system of which they form part. It is based on the notion of the iterative development of output of an explicitly presented normative code, under a given condition. It is neither axiomatic in style nor formulated in terms of a semantics of "possible worlds". It develops output by repeated detachment rather than by consequence (so as not to lose the directionality of conditional norms), and it distinguishes between gross and net output (so as to deal adequately with conditions that are "contrary-to-duty"). The investigation also provides new perspectives on some well known problems. In particular, it throws light on the way in which explicit obligations may have a part in generating permissions, and how explicit permissions may limit obligations. It also helps pin down a distinction between "substantive" and "technical" defeasibility of conditional norms. 1. Introduction: the problem There is a singular tension between the philosophy of norms and the formal work of deontic logicians. On the philosophical level, it is widely accepted that a distinction may be drawn between norms on the one hand, and declarative statements or propositions on the other. Declarative statements may bear truth-values, i.e. are capable of being true or false,
whilst norms are items of another kind. They assign obligations, permissions, and prohibitions. They may be applied or not, respected or not, and may also be subject to evaluation from the standpoint of other norms, as for example when a legal norm is judged from the point of view of a moral code. But it makes no sense to describe norms as true or as false. Of course, one may say with truth that such and such a norm is (or is not) part of (or implied by, consistent with, etc.) such and such a normative code. For example one may say that the British driving code requires vehicles, in normal circumstances, to be driven on the left hand side of public thoroughfares, while the American code requires otherwise. But such statements are not themselves norms. They report on the presence or absence (or more complex status) of a norm in a given normative system. To mark the difference, they are sometimes called "normative propositions" or "propositions about norms". On the formal level, however, work goes on as if such a distinction had never been heard of. In axiomatic presentations of systems of deontic propositional logic, the truthfunctional connectives "and", "or" and most spectacularly "not" are routinely applied to items construed as norms, forming compound norms out of elementary ones. But as (Dubislav 1937) and (Jшrgensen 1937-8) already observed, if norms lack truth-values then it is not clear what could be meant by such compounding. For example, the negation of a declarative statement is understood to be true iff the item negated is false, and false iff the latter is true; but we cannot meaningfully formulate such a rule for norms. In semantic presentations, models are constructed that blithely assign truthvalues to norms in possible worlds, and define validity in a model as truth in all its worlds. There are a few deontic logicians such as (Kalinowski 1972) who take the view that norms do, after all, bear truth-values. Such a position has at least the merits of forthrightness and consistency - provided it is applied to all norms, great and small, moral, legal or aesthetic, personal or communal, that are taken to fall within the scope of deontic logic. But most deontic logicians accept that there is a fundamental distinction to be made, and find themselves in the uncomfortable position - indeed the unprincipled and close to inconsistent one - of conceding that norms do not bear truth-values, but hoping that for the purposes of logic they may, for some mysterious reason, be treated as if they did. It is thus a central problem - we would say, a fundamental problem - of deontic logic to reconstruct it in accord with the philosophical position that norms are devoid of truthvalues. In other words: to explain how deontic logic is possible on a positivistic philosophy of norms. A natural first reaction is to regard the problem as trivial. On the syntactic level, all we need to do is re-read deontic formulae as propositions about norms, rather than as being themselves norms. As suggested for example by (Hansson 1969, section 3), we need only read a formula O or P as saying that is obligatory, or permitted, according to some fixed system N of norms. On the semantic level, it is enough to take one's preferred possible-worlds semantics and reinterpret its deontic components as relativised to a given normative system N. In particular, we might interpret the "betterness" relation between possible worlds by putting one world better than another iff it violates only a subset of the explicit obligations of the system N, that are violated by the other.
Such a reaction is perfectly in order ­ so far as it goes. But it waves a hand in the direction of a solution, rather than supply one. On the syntactic level, it remains to provide a precise formulation of the new reading of deontic formulae as reporting the norms that hold "according to" a particular code. The problem is to identify the norms that are implicit in a code on the basis of those that it presents explicitly, without appealing to some already given deontic logic. For unconditional obligation this is relatively easy to do, although it is also easy to go wrong even at that level as we shall see in section 2.1 below. But for conditional norms it is quite elusive. In effect, the present paper attempts to carry out that task. On the semantic level, the problem is quite different. The definition of a "betterness" relation between possible worlds suggested above, in terms of the set of explicit promulgations of the code that are violated in each world, is perfectly precise; and such a relation permits a semantic account of conditional obligation. However, such a construction faces at least three difficulties. One of these is validation of formulae O(/) whose intuitive standing is open to question.1 Another is that it is rather difficult to construct an account of what is known as strong or positive permission along the same lines; the only work in this area known to the author is that of (van der Torre 1997, section 2.4.1). Positive permission appears to be needed by real-life normative systems that change over time, as a device for limiting the interpretation of obligations and preventing their proliferation. In particular, as pointed out by (Alchourrуn and Bulygin 1984), in legal contexts it is needed to limit the authority of subordinate instances to create new norms. Finally, the above semantic construction gives an unintuitive result in examples such as the following, whose name is suggested by its shape. Example 1 (Mцbius strip). Consider a code with just three explicit norms, stating that is obligatory given , that is obligatory given , and that ¬ is obligatory given . Intuitively, is natural to conclude that under condition , each of and is obligatory (even though we may not want to conclude for ¬ under the same condition, as we shall see when discussing contraryto-duty conditions). But under the above possible worlds account, defined as above modulo the code, both O(/) and O(/) come out false. Consider the world w that puts true but and false. This world is minimal among all -worlds under the relation defined : it violates only one of the three explicit norms (the first one), and clearly no -world w' violates none of them, for when w' satisfies so as not to violate the first one, it will violate the third or second according to whether it satisfies or not. For readers indifferent to the philosophical motivation, the work of this paper may still have some formal interest. Deontic logic has fallen into ruts. The older rut is the axiomatic approach, with its succession of propositional and occasionally quantified calculi. The newer one is possible-worlds semantics, with endless minor variations in the details. We depart from these confines, with an approach which, whilst syntactic rather than semantic, is not at all axiomatic in character. It could be called iterative. To be sure, any really adequate representation of norms requires much more than truthfunctional and deontic operators. It needs to represent the instantiation of variables and indeed full quantification, as well as the passage of time, human agency, competences and powers, bearers and counterparties of obligations, and so on. Any formal language
lacking the means to handle such elements will inevitably yield counter-intuitive results in certain applications. Nevertheless, our policy in this paper is to work with the simplest possible syntactic apparatus, reserving complex machinery until the exact limits of the more spartan one are clear - and only in so far as it is confirmed that its essential ideas are indeed "on the right track". 2. Background: constructions of Stenius and Alchourrуn/Bulygin 2.1. A first move by Stenius 1963 In a little-known paper, Stenius (1963) made what is perhaps the first move to deal with our "fundamental problem". We recall the essential ideas. Stenius works with a propositional language with boolean connectives that may be applied to any formulae, and the deontic operator for obligation, which is allowed to operate only on purely boolean formulae ­ so that embedded deontic connectives are not allowed. A normative code is identified with a set A of formulae of the form O, where is boolean, that is closed under an appropriate consequence operation. Stenius adds to the usual evaluation rules for the truth-functional connectives one for obligation, putting vA(O) = 1 iff O A. At the time of its formulation, this simple construction represented a major, and rather isolated break with the tradition that had set in since (von Wright 1951). It considers norms modulo a normative code, fixed as parameter. Although Stenius does not use the phrase, we can say that his approach heeds the warning: no logic of norms without attention to the normative systems in which they occur. However, the construction faces three basiC Difficulties - an apparent circularity and two technical gaps. The former appears as soon as we ask: what is the consequence operation under which A is taken to be closed? It cannot be classical consequence, as the elements of A are not purely boolean, but are of the form O. It must be an already given consequence operation over at least atomic deontic formulae - which is what we are trying to reconstruct in a philosophically principled manner. One technical gap is that the construction has no means of handling conditional obligations and permissions - which, it is generally accepted, are not reducible to unconditional ones. The other is that it makes no attempt to handle positive permissions, whether conditional or unconditional. 2.2. The construction of Alchourrуn/Bulygin 1981 Alchourrуn and Bulygin (1981) took Stenius' idea further, avoiding the circularity and plugging one of the two gaps ­ positive permission, but not conditionality; see also Alchourrуn (1993, especially section 3.2.4). We recall their construction, reformulating it somewhat to bring out more clearly the formal structure. 2 Again, one works with a propositional language with boolean connectives operating on any formulae, and deontic connectives applicable only to purely boolean formulae, so that embedded deontic connectives are not admitted. The deontic connectives involved are now both O and P, for obligation and positive permission. An unconditional normative code is defined to be a pair N = (A,B) where A, B are sets of purely boolean formulae. Intuitively they represent, respectively, the states of affairs
that the code explicitly requires to come into effect, and those that it explicitly permits to do so. There is thus a small, but immensely significant step compared to the sketch of Stenius (1963). Alchourrуn and Bulygin appear to have been the first to realize the liberating effect of taking the set of promulgations of a normative code to be made up of purely boolean formulae. At the same time, they consider explicit permissions along with promulgations. An unconditional valuation structure is a pair (N,v) where N = (A,B) is a normative code, and v is an assignment of truth-values to elementary letters. Intuitively, the latter is understood as representing the truth-values of propositions in the real world. Given a valuation structure, one defines an assignment vN of truth-values to all formulae by means of the following rules, where is classical logical consequence: For elementary letters, vN agrees with v For boolean connectives, vN behaves in a boolean manner vN(O) = 1 iff A vN(P) = 1 iff for some B. A formula is called valid iff vN() = 1 for every valuation structure. 2.3. Immediate formal features There is more to these rules than meets the eye, and we comment on their formal and philosophical features. The last two rules are well-defined, because A,B are sets of purely boolean formulae and also the connectives O,P may be applied only to purely boolean formulae, so that for all formulae O and P it is meaningful whether A and whether for some B, where is classical consequence. Of course, another way of writing these conditions is Cn(A), Cn-1()B , where Cn is classical consequence expressed as an operation. We shall move freely from one notation to the other, according to ease of reading. Clearly, for purely boolean formulae, the truth-value of does not depend on what the normative code N is, but only on what the truth-values of elementary letters are under v. In contrast, the truth-values of O, P do not depend on what the truth-values of elementary letters are, but only on what A, B, are. In other words, O and P are treated as records of the status of in the code N, i.e. as propositions about norms, as desired. Evidently for mixed formulae, e.g. ¬O where is purely boolean, the value will in general depend on both v and N. The rule for permission expresses a notion of positive or strong permission, as contrasted with negative or weak permission Pw, which requires only that A ¬ fails, and for whose valuation the second set B is not relevant. It tells us that P is true in a given valuation structure iff is a classical consequence of some explicitly permitted proposition. This is as it should be, since intuitively each of several actions may be permitted without thereby permitting their conjunction. It contrasts with the rule for obligation, which tells us that O is true in a given valuation structure iff is a classical consequence of the entire set of explicitly promulgated propositions. The rule for strong permission may also be motivated in the following way. We understand an explicit strong permission of , as a commitment not to allow the set of
explicit promulgations to grow in such a way as to render forbidden. So we put vN(P) = 1 iff ¬ Cn(X) for every set X of explicit promulgations such that ¬ Cn(X) for all B. Clearly this is equivalent to the above definition, and it will be useful when we come to consider conditional norms. 2.4. Independent versus dependent rules In the construction of Alchourrуn and Bulygin, permissions are determined entirely by the set B, and promulgations have no role in generating them. Likewise, obligations are determined entirely by the set A of promulgations, and explicit permissions have no effect in limiting them. The former feature yields the invalidity of the "should implies may" principle O P as well as (OP) P(), and the latter gives rise to the invalidity of P ¬O¬ (which of course could also be written contrapositively as O ¬P¬, or again as P Pw where Pw is weak permission). For the invalidity of O P. Consider the code where A = {} and B = {}. Here (and in all examples) we take ,,... to be distinct elementary letters. Then vN(O) = 1 since , but vN(P) = 0 since fails, and thus vN(O P) = 0. For the invalidity of (OP) P().Use the same example. Since we have vN(O) = 1, and since we have vN(P) = 1, so that vN(OP) = 1. But fails, so vN(P()) = 0. For the invalidity of P ¬O¬. Put A = {¬} and B = {}. Then clearly vN(P) = 1, and also vN(O¬) = 1 so that vN(¬O¬) = 0. We note in passing that if P is read as weak permission then the construction validates trivially the third of these principles, validates the second without restriction, and validates the first under the hypothesis that A is classically consistent. It is of interest to observe that a variation on the evaluation rule for permissions allows the set of explicit promulgations to have a part in generating them. Simply replace the rule by the following, which brings A into play alongside B. vN(P) = 1 iff {}A for some B. That is, P is true in the valuation structure iff it is a consequence of some explicitly permitted proposition taken together with all the explicitly promulgated propositions. We call this the promulgation-dependent version of the rule for permission, in contrast with Alchourrуn and Bulygin's independent version. Then the formula (OP) P() becomes valid; and although strictly speaking O P remains invalid, we have vN(O P) = 1 whenever B . For (OP) P(). Suppose vN(O) = 1 and vN(P) = 1. By the former, A and by the latter, {}A for some B. Hence {}A and so vN(P()) = 1. For O P. Observe that whenever vN(O) = 1 we have A so that {}A for all boolean formulae and in particular for some B provided B is non-empty, so that vN(P) = 1. Conversely, one may wish to allow explicit permissions to influence obligations and, more particularly, to limit them. The idea is to trim the explicit promulgations when there is conflict, giving priority to generated permissions. It is somewhat akin to the operation of belief contraction. As Sven Ove Hansson has remarked (personal communication) it can also be seen as introducing a special kind of defeasibility: a
permission can prevent an explicit promulgation from creating an obligation. However, as one would expect, there are a number of different ways of defining such operations, each with its attractions and blemishes. The simplest procedure would be to put vN(O) = 1 iff A and there is no B with ¬, i.e. iff A and vN(P¬) = 0. Another approach is to put vN(O) = 1 iff X for every maximal subset X A that does not imply the negation of any element of B. We do not set out systematically the behaviour of such permission-dependent accounts of obligation, nor attempt to adjudicate between them. It is also natural to ask whether one can formulate, in a sensible way, a fourth version of the valuation rules in which they are mutually dependent, with explicit promulgations creating permissions and explicit permissions limiting obligations. In the author's view, this is a particularly delicate task, even after settling on a particular account of permission-dependence. We do not attempt it here. 2.5. Alchourrуn's 1993 extension As remarked in section 2.2, the construction of Alchourrуn Bulygin (1981) has no apparatus for handling conditional obligations and permissions, and our main purpose in this paper is to develop it to do so. An attempt in this direction was made by Alchourrуn (1993, section 3.4). He extends the set of formulae as one would expect, by introducing two-place connectives for conditional obligation and permission, read intuitively as is obligatory (permitted) on condition . Like the unary deontic connectives, they may be applied only to purely boolean formulae, whilst boolean connectives may be applied to arbitrary formulae. Alchourrуn's construction is intended to model only indefeasible conditional norms. The idea is to work with an indexed family of unconditional normative codes Nu = (Au, Bu), one code for each assignment u of truth-values to propositional letters. If N is such a family, then a conditional obligation O(/) is counted as true in N iff is a classical consequence of every set of promulgations associated with an assignment satisfying . In other words, vN(O(/)) = 1 iff for every assignment u, if u() = 1 then Au . However, this construction has certain shortcomings. On the one hand, there are principles that it validates "too easily". In particular, the principle of monotony O(/)O(/), also known as "strengthening the antecedent", holds without restriction, simply because every assignment satisfying satisfies . Although we are considering norms intended as indefeasible, we shall see that there are reasons to believe that when is "contrary-to-duty", monotony requires qualification. In general terms, Alchourrуn's definitions take no heed of the subtleties arising for contrary-to-duty conditions. On the other hand, there are principles that it fails "too radically". The construction takes as "given" a function associating an unconditional code with each "possible world". But it leaves quite arbitrary which codes are associated with what worlds. As a result, transitivity for conditional obligation, O(/)O(/) O(/), fails. Roughly speaking, the left hand side tells us that whenever u() = 1 then Au and whenever u() = 1 then Au . But, unless we make the unmotivated assumption that the code Au contains only items that are true under u, Au does not imply u() = 1 and so we cannot combine the two pieces of information. We do not suggest that the transitivity principle is acceptable without restraint. Indeed, we shall see that it also needs to be
qualified in contexts involving "contrary-to-duty" conditions, as well as those involving the passage of time or variation in the bearer of the obligation. But in Alchourrуn's construction the principle fails without residue. For these reasons, we shall follow a more analytical approach that replaces the family of unconditional codes by a single conditional code. Like Alchourrуn (1993), we intend our construction for substantively indefeasible conditionals, although we shall see that even for them a certain kind of "technical defeasibility" arises from contrary-to-duty conditions, so that monotony, transitivity and some other principles hold only under certain hypotheses. 3. The iterative approach 3.1. Preliminaries and guiding ideas We consider the same formulae as for Alchourrуn (1993). We define a conditional normative code to be a pair N = (C,D) where C,D are sets of ordered pairs (,) of purely boolean formulae.3 A conditional valuation structure is a pair (N,v) where N is a conditional normative code, and v is an assignment of truth-values to elementary letters. As before, we take a formula to be valid iff vN() = 1 for every valuation structure (N,v). Intuitively, (,) C means that the normative system explicitly requires in the situation , and (,) D means that it explicitly permits in that situation. Of course, the direction of reading (,), whether from right to left or inversely, is of no significance as long as it is fixed; we use the right-to-left reading to harmonize with that of formulae O(/). The formula is called the head or consequent of (,) and is called its body or antecedent. For simplicity we focus on developing "independent" rules for the operators of conditional obligation and permission, indicating only briefly in section 3.5 how they might be adapted to obtain "promulgation-dependent" and "permission-dependent" versions. To appreciate what is going on, it may help to bear in mind the general policies guiding the technicalities. They will be explained more fully as they come into play. · As indicated above, we work with a single conditional code rather than with an indexed family of unconditional ones; · When developing the explicitly given elements of a code, we use iterated detachment instead of consequence, in order to not to lose the directionality of conditional norms; · At the same time, we distinguish between gross and net output, the latter moderating the former in order not to drown conditional norms whose bodies are "contrary-to-duty". 3.2. Conditional obligation 3.2.1. Consequence versus detachment
Let N = (C,D) be a conditional normative code. Let be a purely boolean formula, which we will be considering in the role of condition. Let v be any assignment of truthvalues to elementary statements. We generalize in a natural way the Alchourrуn/Bulygin valuation rule for unconditional obligation, putting: vN(O(/)) = 1 iff out(C,) where out(N,) is the "output" of the set C under the condition . The question is: how to define out(C,)? At first sight, the answer may appear to be obvious: just put out(C,) = Cn({}{: (,) C}), i.e. the classical consequences of the set consisting of condition taken together with the material implications associated with the explicit promulgations in C. However, such a definition would be far from the mark. For one thing, it puts out(C,). For another, it permits contraposition. This is not due to its use of material implication , but rather to the way in which classical consequence is deployed. Indeed, as Lloyd Humberstone has remarked (personal communication), for any function f on promulgation sets C, if we define out(C,) = Cn({}f(C)) then we immediately have out(C,) iff Cn({}f(C)) iff ¬ Cn({¬}f(C)) iff ¬ out(C,¬). On the other hand as is widely recognised, contraposition is quite undesirable from the point of view of the intended reading. For example, suppose that the normative system contains a pair (,) where is "I show the inspector my train ticket" and is "The inspector asks to see my train ticket". The normative system requires that I show my ticket in the case that the inspector so requests, but it certainly need not require that the inspector be silent if I do not show it. For an example with no distracting change of agent and little trace of the passage of time, consider the rule that if you change address you should inform the local post office; this hardly implies that if you do not inform the post office, then you should not change address. There is a profound asymmetry or directionality in conditional norms, which is lost in brutal application of the consequence operation. For this reason, we need to use a quite different technique in defining the output of a code under a condition, and the one that seems most appropriate is iteration of successive detachments. The exact construction is quite subtle and we shall proceed in two steps. In the first step we formulate a concept of "gross output", serving as a first approximation. The second step nuances gross output in order to deal adequately with "contrary-to-duty" conditions, giving the desired notion of "net output". However, the time spent on gross output is not wasted, as it remains an essential tool for analysing the final construction. 3.2.2. Gross output Let N = (C,D) be a conditional normative code. For any boolean formula , we define the gross output of N under the condition , written out*(N,) or more usually as out*(C,) as its definition does not depend on the set D of explicit permissions, to be the product of iterated detachments on the explicit promulgations of the code, starting from , and allowing also for secondary operations along the way. To be precise, we put out*(C,) whenever any of the following six inductive clauses hold: · Basis: (,) C
· Iterated detachment: 1 out*(C,) and out*(C,1) · Body strengthening: out*(C,1) and 1 · Head weakening: 1 out*(C,) and 1 · Head conjunction: i out*(C,) for all i n and = i · Body disjunction (or proof by cases): out*(C,i) for all i n and = i . In the last two clauses, it is understood that n 1. When the identity of C is fixed and clear we will also write out*(C,), alias out*(N,), simply as out*(). Just as for the unary counterpart, the value of vN(O(/)) in a valuation structure (N,v) depends on the formulae , and the normative code N (more specifically, on its positive ingredient C), but not on the "real world" truth-assignment v. We are attributing truth-values to deontic formulae, but read as propositions about norms. We draw attention to the formulation of iterated detachment. It conjoins the condition with its output 1 in order to activate another condition. Transitivity is what we would have if only 1 could be used. Clearly, transitivity follows from iterated detachment with body strengthening. It is important to notice that in general we do not have out*(). For example, put C = {(,)}; then out*() = Cn(). Indeed, it is easy to check by induction that out*() is always a subset of the closure under classical consequence of the set of all heads of elements of C. Example 2 (Joined forces). Put C = {(¬,), (,)}. Here (and throughout the paper) is a tautology. Then out*() contains ¬ (by base and body strengthening) and also (by base, body strengthening and iterated detachment), but it contains neither nor . 3.2.3. Shortcoming Gross output runs into difficulty when the condition under consideration is inconsistent with the heads of norms that it activates. Recall that since (Chisholm 1963), a condition for an obligation is informally called "contrary-to-duty" if it is itself in violation of some obligation. For example, one may have the responsibility for repairing the fender of a neighbour's car in the (contrary-toduty) case that one has carelessly backed into it in the parking lot. It is true that this example involves implicit reference to the passage of time; indeed that is a feature of most real-life examples, as noticed by (Loewer and Belzer 1983). But it does not appear to be an intrinsic feature. As observed by (Jones and Pцrn 1985), there are also real-life examples from which time is absent. For instance, as remarked by (Prakken and Sergot 1996), regulations for a group of holiday cottages may require the dwellings to be fenceless, but also require fences to be white in the contrary-to-duty situation that they exist. It is also important to bear in mind, as again emphasized by Prakken and Sergot (1996), that contrary-to-duty conditions arise for indefeasible obligations as readily as for defeasible ones. A simple formal example, deriving ultimately from Chisholm (1963), shows how our gross output may behave counter-intuitively under a contrary-to-duty condition. Example 3 (Chisholm). Take C = {(,), (¬,), (¬,¬)} and consider condition . The code thus promulgates ¬ under the tautologous condition,
and contains two other conditional promulgations, one with body and the other with body ¬. Consider as condition. Intuitively, we would like to get O(/), but not O(¬/), nor O(¬/). But clearly by applications of the base clause, body strengthening and iterated detachment, we get in out*() all of , ¬, ¬, and thus by head conjunction and weakening also every boolean formula. 3.2.4. Net output Why is gross output unsuitable for contrary-to-duty conditions? When we entertain a condition , we want to look beyond the question of whether that condition should never have been realized, and consider only what should be done given that it is realized. So, if the code yields the negation of the condition as an output, we need to make adjustments. In this spirit, we make a distinction between gross and net output. The essential idea of net output is that given a condition , we use only those pairs in C whose heads are consistent with . It is tempting to do this by putting out(C,) = out*(C,) where C is a maximal subset C C such that out*(C,) is classically consistent with . However, this maxichoice approach (which the author followed for some time) runs into at least two serious technical difficulties. In the first place, it fails to guarantee certain inferences that intuitively should be accepted. Indeed, this is illustrated by the "Mцbius strip" example, already employed in section 1 in connection with a "possible worlds" approach. Example 4 (Mцbius strip). Let C = {(,), (,), (¬,)}. Intuitively, we would like to have , out(). But there are three possible values of the "maxichoice" set C , namely the three two-element subsets of C. For only two of those three values of C do we get out(), and for only one is out(). In the second place, the maxichoice approach runs into difficulty with disjunction. Specifically, it seems able to give an adequate account of "proof by cases" only in the case of a finite language, and there in an exceedingly complex manner. Note that the definition of out*(C,) makes use of elements of out*(C,i) for arbitrary i with = i. Hence we should look at not only those C C with out*(C,) consistent with but also, for each such i, the C C with out*(C,i) consistent with i. In the finite case it may be possible to sort this out inductively, by first considering values of that are atoms and then working up the boolean lattice step by step. But this would be quite complex and disappointingly restricted. A better procedure, we believe, is to control for "consistency with the condition" in a more piecemeal way, using a labelled deductive system in the sense of (Gabbay 1996), adapting ideas in particular from van der Torre (1997). The elements of out(C,) are no longer taken to be plain formulae , but labelled formulae : L. There is nothing mysterious about these. They are simply pairs (,L); we use a colon merely for visual relief. The purpose of L is to serve as a record of the heads of all explicit promulgations used in getting . When there is no application of reasoning by cases, L can be taken to
be a boolean formula, that grows by conjunction as more promulgations are used, and for heuristic purposes it is advisable to keep this simple case in mind. But in general, to cover the parallel tracks created through reasoning by cases, we need to consider labels that are sets of boolean formulae. Formally we define out(C,) by putting : L out(C,) whenever any of the following inductive clauses hold, provided that is consistent with each element of L. The six clauses parallel those for gross output (differing only in the presence and specification of labels) and we call them by the same names. · (,) C and L = {} · 1: L1 out(N,) and : L2 out(N,11), and L = {12: i Li} · : L out(N,1) and 1 · 1: L out(N,) and 1 · i: Li out(N,) for all i n and = i , and L = {i: i Li} · : Li out(N,i) for all i n and = i , and L = {Li: i n}. To understand the label L = {i: i Li} in the clause for head conjunction (and likewise the label in the clause for iterated detachment) remember that for each i, Li consists of a number of formulae, one for each case in the derivation of i . The set of cases involved in the derivation of the conjunction is the Cartesian product of the sets of cases involved in the derivations of the conjuncts. The label of the conjunction is formed accordingly: each element of L is a conjunction with one conjunct from each of the labels Li. Evidently, when a derivation contains no applications of body disjunction (proof by cases) then each label Li contains a single formula, and L will consist of the conjunction of those formulae. Again, if all the Li are singletons except for L1 which contains two formulae 11 and 12, then L will contain two formulae, namely 112...n and 122...n. When a label consists of a single formula, we shall usually simplify notation and write the label as that formula. As labels are used only for consistency checks, we will also take the liberty of writing any formula in a label in its simplest classically equivalent form. Thus, for example, the label {} is written as . The purpose of the labels is to control the production of elements of the net output, rather than to differentiate them within that output. For this reason, we use the "flattening" definition for unlabelled formulae, that puts out(C,) iff : L out(C,) for some label L. We shall also express the latter as: out() with label L. We illustrate the definition with three examples. The first is the "window" example of (von Wright 1964), and illustrates the situation where the condition under consideration activates promulgations with incompatible heads. The other two are the Chisholm example and our "Mцbius strip", already considered in connection with gross output. They illustrate "contrary-to-duty" situations, where the condition under consideration is incompatible with the head of one of the explicit promulgations that are activated. As has been emphasized by Prakken and Sergot (1996) and by van der Torre (1997), these are quite different kinds of conflict. Whereas consistency checks may be used to handle contrary-to-duty conditions, the standard procedure for resolving conflicts between incompatible heads is prioritisation of the explicit promulgations. Such prioritisation could be integrated into our iterative account, but in this paper we consider only the unprioritised case.
Example 5 (von Wright). Put C = {(,), (¬,)}, and consider condition . Intuitively, one may think of as representing "the window is closed", as "the sun is shining", as "it is raining", noting that the latter two are mutually consistent. We have ,¬ out() with labels ,¬ respectively, but the consistency check on the clause for head conjunction prevents us getting ¬ out(), since its label ¬ is inconsistent and so inconsistent with the condition . Example 6 (Chisholm). We compare the net output under condition with the gross one in the contrary-to-duty Chisholm example C = {(¬,), (,), (¬,¬)}. Clearly out() with label , since is consistent with . But although (¬,) C, we cannot conclude that ¬ out() since its label ¬ is inconsistent with . And so we cannot go on to get ¬ out() with label ¬¬. Example 7 (Mцbius strip). Recall that in this example C = {(,), (,), (¬,)}. Intuitively, we would like to have , out(), but ¬ out(). Clearly, gross output puts each of , ,¬ out*(). As we have seen, a "maxichoice" approach to net output can give three different results according to which we choose among the three maximal subsets of C whose gross output under is consistent with . Under the labelled definition of net output we get , out() with labels and respectively but, as desired, ¬ out() since its label ¬ is inconsistent with . The Mцbius strip example illustrates how in the labelling approach we just go on detaching until we hit trouble. Here "trouble" means inconsistency of the condition under consideration with the conjunction of all heads so far used in the derivation ­ or, in the general case that reasoning by cases is involved, in some case of the derivation. The purpose of the label is to carry along sufficient traces of the derivation to be able to make the consistency check locally. We end this section by noting some formal properties of net output, that will also be useful in section 7. (1) Relation with gross output. Clearly, whenever : L out(C,) then out*(N,) so that by the flattening convention, out(C,) out*(C,). For this reason, although we work with net output in preference to gross, the latter remains an important tool of analysis. (2) Consistency proviso: partial redundancy. In the definition of net output, each of the six clauses is qualified with the consistency proviso that is consistent with each element of L. In fact, the consistency check is redundant for two of the clauses: head weakening and (as observed by van der Torre: personal communication) body disjunction. This is easily verified by an inductive argument, noting that in the head weakening clause neither the condition nor the label changes, whilst in the body disjunction clause the induction hypothesis tells us that for all i n we have each i consistent with each element of Li , so that i is consistent with each element of L = {Li : i n} and the proviso is satisfied. (3) Consistency properties for output elements. It is immediate from the presence of the consistency proviso that whenever : L out(C,), is consistent with each element of L. It is also clear by induction that whenever : L out(C,), we have for each
element of L. Putting these together and using the flattening convention, it follows that whenever out(C,), then is consistent with , and so is itself consistent. (4) Preservation of equivalence and monotony properties: right argument. We have preservation of equivalence in the right argument: out(C,) = out(C,') whenever Cn() = Cn('). This is by straightforward induction, noting that will satisfy a consistency proviso iff ' does. However, we do not in general have monotony in the right argument: we do not have out(C,) out(C,') whenever Cn() Cn('), for it is blocked by the consistency proviso on the clause for body strengthening. (5) Preservation of equivalence and monotony properties: left argument. On the one hand, monotony under inclusion is immediate for the left argument: out(C,) out(C',) whenever C C'. However that we do not have monotony under any natural notion of consequence in that argument. In fact, we do not even have preservation of equivalence, for net output is very sensitive to the formulation of the explicit conditional promulgations in C. Example. Compare the value of out(C,) when C = {(¬,)} with its value when C = {(,), (¬,)}. In the former case, out(C,) = whereas in the latter, out(C,) contains each of ,¬ but not their conjunction. It is debatable whether this dependence of the value of net output on the manner of presentation of the explicit promulgations should be regarded as a virtue or a vice. On the one hand, independence from syntax simplifies structure, and is generally a desirable feature in a formal representation, to be abandoned with reluctance. On the other hand, as observed by (Prakken and Sergot 1997, sections 7-8), consideration of the "gentle murderer" example of (Forrester 1984) and variations on it suggest that in the present context such dependence may be intuitively desirable. Indeed, as noted by (Carmo and Jones 1997, section 8), this is particularly evident in the well-known "Reykjavik scenario" of (Belzer 1987). We recall that in the Reykjavik scenario, the explicitly presented promulgations are three: neither Reagan nor Gorbatchov should be told the secret, if Reagan is told then Gorbatchov should be told, and if Gorbatchov is told then Reagan should be told. Intuitively, under the condition that Gorbatchov is told, we would like to be able to conclude that Reagan should be told, without also deriving its negation. On the other hand, if the first item is broken down into two parts, saying separately that Reagan should not be told and that Gorbatchov should not be told, so that there are four explicitly presented promulgations, then the conclusion to draw seems intuitively more ambiguous, depending on whether promulgations are prioritised according to, say, specificity of their antecedents. In the absence of prioritisation we seem authorised to conclude both that Reagan should be told and that he should not; with prioritisation, only the former. The iterative account, which we have formulated for non-prioritised codes, fits well with these intuitions. Take the first representation as {(¬¬,), (,), (,)} and the second as {(¬,), (¬,), (,), (,)}. For the first representation we have that out(C,) with label , but ¬ out(C,) since the only available derivation introduces the label ¬¬, inconsistent with . But for the second representation we have both out(C,) with label , and ¬ out(C,) with label ¬, although ¬ out(C,).
3.2.5. Limitations We note two aspects of our construction that could be questioned. One concerns the role of detachment, and the other concerns the "irreversibility" of conditions. We suggest that both of these indicate severe limitations to its applicability to real life examples, arising from its total abstraction from questions of time and of bearer. Iteration of detachment. The definition of gross output authorises iteration of detachment, as also does net output under the consistency proviso. But as Sven Ove Hansson has reminded the author (personal communication), there are simple examples in which we would not want this to be so. Example. Let C = {(,), (,)} where is "John owes Peter \$1000", is "John pays Peter \$1000", and is "Peter Gives John a receipt for \$1000". Then out() so that vN(O(/) = 1. On the other hand, intuitively we would say that in the circumstance that John owes Peter \$1000, considered alone, Peter has no obligation to write any receipt. That obligation arises only when John fulfils his obligation. There appear to be two principal sources of difficulty here. One concerns the passage of time, and the other concerns bearers of the obligations. We recall that our representation of norms abstracts entirely from the question of time. Evidently, this is a major limitation of scope, and leads to discrepancies with real-life examples, where there is almost always an implicit time element. This may be transitive, as when we say "when holds then should eventually hold", or "...should simultaneously hold". But it may be intransitive, as when we say "when holds then should hold within a short time" or "...should be treated as a matter of first priority to bring about". Clearly, iteration of detachment can be legitimate only when the implicit time element is either nil or transitive. Our representation also abstracts from the question of bearer, that is, who (if anyone) is assigned responsibility for carrying out what is required. This too can lead to discrepancies. Iteration of detachment becomes questionable as soon as some promulgations have different bearers from others, or some are impersonal (i.e. without bearer) while others are not. Only when the locus of responsibility is held constant can such an operation take place. Sven Ove Hansson's example above involves both of these factors. When neither is involved, iteration of detachment does appear to be appropriate, as in the following example, based on instructions to authors preparing manuscripts. Example. Let C be the same as above, but where is "The text area is 25 by 15 cm", is "The font size for the main text is 12 points", and is "The font size for the list of references is 10 points". Irreversibility of conditions. The consistency proviso for the base clause of the definition of net output prevents detachment of the head of an explicit promulgation when it is inconsistent with the body. We are thus in effect excluding the possibility that what should be the case under condition , is its opposite ¬. As remarked by (Bengt Hansson 1969, section 13), in non-temporal contexts this is surely part of what is involved in taking a condition seriously. On the other hand, it does make it awkward to deal with examples saying that if condition holds at a certain time, ¬ should be hold subsequently. An adequate representation of such examples
would have to go beyond our framework and make explicit reference to the passage of time. As mentioned in the Introduction, our policy is to sail closer to the Scylla of oversimplification than the Charybdis of excessive complexity. In our view, formal machinery to handle time and bearers (e.g. by indices) should be introduced after the simpler structure is well understood and it becomes clear that its essential ideas are on the right track. We do not do so in this paper. 4. Benchmark Examples In the following table we summarize the performance of the iterative account in a number of well-known examples, four of which (von Wright's "windows", Chisholm's "help and inform", Belzer's "Reykjavik scenario" and our "Mцbius strip") have been mentioned in the preceding discussion. In order not to overburden the presentation, we assume a passing acquaintance with the examples, and use letters mnemonically for the statements involved. Thus in the example from Chisholm (1963), h is for "you go to help your neighbours" and i for "you inform them that you are coming". However, in the last three examples, the letters have no mnemonic value. For uniformity of font, we use t for the tautology, rather than the elsewhere in the paper. The first column gives the original source of the example and its usual name. The first four have been discussed extensively in the literature; the last two are presented here for the first time. In the second column we write the explicit promulgations of the example, using the notation of this paper. The original presentations were written in various notations, most commonly with a conditional obligation operator O(¬f/t) where we have (¬f,t). In two of the examples ("Reykjavik scenario", "apples and pears") we consider variant sets of explicit promulgations. The third column contains the conditions under consideration. In most of the examples we consider more than one condition.
Source and name Explicit promulgations Condition No
von Wright 1964: window closing Chisholm 1963: help and inform
(c,r), (¬c,s) (h,t), (i,h), (¬i,¬h)
rs 1. t 2. ¬h
c¬c h, i
Forrester 1984: gentle murderer
(¬k,t), (g,k)
1. t
g
2. k
¬k
Belzer 1986:
1. (¬r¬g,t), (r,g), (g,r) r
¬g
Reykjavik scenario 2. (¬r,t), (¬g,t), (g,r), (r,g) r
Prakken/Sergot 1996: (¬k,t), (¬c,t), (c,k)
k
¬k
cigarettes for killer
Prakken/Sergot 1996: (¬f,t), (wf,f), (wf,d)
1. f
¬f
white fence and dog
2. d
3. fd
¬f
van der Torre 1997: (ap,t), (¬a,t) apples and pears 4. (ap,t) 5. (a,¬p), (p,¬a)
1. t 2. ¬a 3. a ¬a ¬a
¬a, p ¬a, p
van der Torre 1997: (a,t), (b,t) joining paths
¬a¬b
ab
Makinson 1998:
(¬b,c), (c,a), (a,b)
b
¬b
Mцbius strip
Makinson 1998:
(ax,b), (a¬x,¬b)
t
exclusive options
Yes c, ¬c h, i ¬i ¬k g g g, ¬g c, ¬c wf wf, ¬f wf ¬a, p ¬a, p ap ap p a, b a, c a
The fourth column singles out some salient items that are not in the output, while the fifth mentions some that are. In all the examples considered, these columns appear to correspond reasonably well with "informed intuition", remembering that we are taking the explicit promulgations as substantively indefeasible and as unprioritised. Of course, "informed intuition" remains debatable. 5. Conditional Permission As in the unconditional case, one can formulate a concept of weak permission of under condition , as ¬O(¬/) i.e. the absence of obligation of the negation of under the same condition. We are also interested, however, in formulating a concept of strong conditional permission. Working backwards, we put the rule as follows, where D is the set of explicit permissions of a code N = (C,D): vN(P(/)) = 1 iff perm(D,). It remains to define perm(D,), the permission set of the code under . Our construction is guided by an intuitive understanding of an explicit strong permission of in condition , as a commitment not to allow the set of explicit promulgations to grow in such a way that is forbidden under condition . So it is natural to take perm(D,) iff ¬ out*(X,) for every set X of explicit promulgations such that ¬ out*(X,) for all (,) D. So understood, it is reasonable to require perm(D,) whenever any of the following three inductive clauses hold: · Basis: (,) D · Head weakening: 1 perm(D,) and 1 · Body weakening: perm(D,1) and 1 . Note that the third clause is one of body weakening - not body strengthening. Given that it is permitted to mow the lawn on Sunday between 10h00 and 12h00, I may conclude that it is permitted to do so on Sunday, but I may not conclude from the latter that it is permitted to mow on Sunday afternoon. It also makes sense in terms of the above intuitive understanding of positive permission, for if ¬ out*(X,) and 1 then it follows that ¬ out*(X, 1). In the above, we have thought in terms of gross rather than net output, and the author suspects that it is the better option. To be sure, if net output is used, body weakening should be dropped or suitably qualified. Conversely, it is possible that there are further closure properties that are reasonable under our intuitive understanding and so should be added. But in what follows, we take the above three clauses as constituting a tentative inductive definition of perm(D,), which we will write simply as perm() when the identity of D is fixed and clear. 6. Dependent Rules for the Conditional Operators If we are considering a normative code N = (C,D), we may wish to allow the set out(C,) to help generate permissions. One way of doing this might be by adding to the definition of perm(D,) the following fourth clause: · Output dependence: 1 perm(D,) and out(C,) and 1 .
Of course, the presence of this clause renders head weakening redundant (provided the output set is non-empty). Conversely, we may wish to make the rule for conditional obligation permissiondependent, so that permissions limit obligations. In principle, this could be done by using maximal non-implying subsets of the output set, but that goes against the spirit of "keep going until you hit trouble" that underlies our general approach. Perhaps the most appropriate move would be simply to add a second proviso to the definition of net output: provided ¬ perm(D,). 7. Behaviour of the conditional operators 7.1. General picture In general, the behaviour of the operators under the iterative account appears to agree reasonably well with "informed intuition". We have already looked at behaviour in some benchmark examples (section 4); we now consider general principles. In order to put some order into the review, we group them into four categories. · Those concerning obligation. We consider some that are valid without restriction (extensionality with respect to both antecedent and consequent, weakening the consequent, disjunction in the antecedent, consistency, monotony with respect to the normative system), some that are valid under a hypothesis (strengthening the antecedent, conjunction in the consequent, transitivity), and some that fail outright (reflexivity, contraposition). · Those concerning positive permission. We mention some that are valid without restriction (extensionality, weakening the consequent and the antecedent, monotony with respect to the normative system) and some that fail outright (reflexivity, contraposition, conjunction in the consequent, transitivity, consistency). · Those expressing relations between the conditional operators and an unconditional counterpart. · Relations between obligation and permission. We report only on the effect of the independent rules. Recall that out(C,) means that : L out(C,) for some label L, and that the operation P(./.) of conditional permission is the positive or strong one, defined by the rules of section 5, rather than the weak one defined as ¬O(¬/). 7.2. Obligation 7.2.1. Valid without restriction The principles of this section follow from properties (1) - (5) of net output noted in section 3.2.4. Extensionality. vN(O(/)) = vN(O('/')) whenever Cn() = Cn(') and Cn() = Cn('). Verification. For the antecedent argument , suppose : L out(). Then as noted in section 3.2.4, is consistent with every element of L. Hence if ' is classically equivalent to , it is also consistent with every element of L, and the consistency proviso for applying the clause of body strengthening is satisfied. For the consequent argument
, the property is immediate from the redundancy, also noted in section 3.2.4, of the consistency check for head weakening in the definition of net output. Weakening the consequent. O(/) O(/) is valid. This is immediate from the redundancy of the consistency check for head weakening in the definition of net output. Disjunction in the antecedent. O(/)O(/) O(/) is valid. This is immediate from the redundancy of the consistency check for body disjunction in the definition of net output. Consistency. ¬O(/) is valid. This is immediate from the fact that whenever out() then is consistent. However, the formula ¬(O(/)O(¬/)) is not valid. As a trivial counterexample, put C = {(,), (¬,)}. Then we have both : out() and ¬: ¬ out(), so that vN(O(/)O(¬/)) = 1, but the consistency check prevents us applying head conjunction to get ¬: {,¬} out(). Monotony with respect to the normative system. This says that if vN(O(/)) = 1 then vN'(O(/)) = 1 when N' is formed from N by enlarging the set of explicit promulgations. This is immediate from the fact that out(C,) out(C,) whenever C C. It should be remarked, however, that if one were to define net output using a maxichoice procedure instead of consistency checks with labels, monotony with respect to C would fail. 7.2.2. Valid under a hypothesis The observations of this section follow from the fact that net output is always included in gross (section 3.2.4), together with properties evident from the definition of the latter (section 3.2.2). Strengthening the antecedent. O(/) O(/) holds whenever out(C,) = out*(C,). For suppose out(). Then out*() so by the body strengthening clause in the definition of gross output we have out*() = out() by the hypothesis. The hypothesis out(C,) = out*(C,) is quite strong. A trivial example shows that it cannot be dropped. Put C = {(¬,)}; then clearly ¬ out() but out() = . Nevertheless, we may weaken it to a more "local" hypothesis: the verification above still goes through assuming only that out*() - out(). Alternatively, if : L out() for some label L every element of which is consistent with . One may regard the above facts either positively or negatively. Looked at positively, they tell us that strengthening the antecedent holds "in normal conditions". On the other hand, we must admit that it fails in certain cases, even though we are considering conditionals that are intended as indefeasible. In general terms, we may distinguish between two ways in which the principle of strengthening the antecedent may fail for conditional norms. It may fail substantively, upon adding a normatively neutral element to the body (more precisely, upon strengthening the body in a way that leaves it normatively neutral). Or it may fail technically, when the strengthened body is contrary-to-duty. Even when the principle holds substantively, as under the present iterative account, it may fail technically. Failure of strengthening the antecedent is a typical formal symptom of the informal property of defeasibility, c.f. (Makinson 1993). We may say that under the iterative
account, even substantively indefeasible conditional obligations are technically defeasible.4 Conjunction in the consequent. O(/)O(/)O(/) holds whenever out(C,) = out*(C,). For if , out() out*() we have by the head conjunction clause for gross output that out*() = out() by the hypothesis. Transitivity. O(/)O(/)O(/) holds whenever out(C,) = out*(C,). For if out() out*() and out() out*() then by body strengthening and the iterated detachment clauses for gross output we have out*() = out() by the hypothesis. In section 3.1 we regarded failure of transitivity as a shortcoming of the account of conditional obligation in Alchourrуn (1993). We now see that transitivity does not fully succeed under our construction either. However, the situation is appreciably different in the two contexts. There, the principle failed utterly; here it holds in all "normal" situations ­ those where out*() - out(). 7.2.3. Outright failure Reflexivity. O(/) fails, for as noted in section 3.2.2, in general out(), even when out() = out*(). We recall the trivial example C = {(,)}. Contraposition. O(/)O(¬/¬) fails as indeed, recalling the "train ticket" example discussed in section 3.2.1, it should. For a trivial counterexample, put C = {(,)}. Then clearly out() so that vN(O(/)) = 1. But ¬ out(¬) = and thus vN(O(¬/¬)) = 0. 7.3. Positive Permission As there are no consistency provisos on the clauses defining positive permission, we have only two categories to consider: principles that are valid without restriction, and those that fail outright. 7.3.1. Valid without restriction Weakening the consequent. P(/) P(/) is valid, immediately from the head weakening clause in the definition of perm (D,). Weakening the antecedent. P(/) P(/) is valid, immediately from the body weakening clause in the definition of perm (D,). Extensionality. vN(P(/)) = vN(P('/')) whenever Cn() = Cn(') and Cn() = Cn('). Immediate from the above two. Monotony with respect to the normative system. If vN(P(/)) = 1 then vN'(P(/)) = 1 where N' is formed from N by enlarging the set of explicit permissions. This immediate from the fact that perm(D,) is monotonic in D, as is easily verified inductively. 7.3.2. Outright failure Consistency. ¬P(/) fails, i.e. we may have vN(P(/)) = 1. This is essentially because there are no consistency provisos in the definition of the permission set. The simplest example is the trivial one where D = {(/)}. Transitivity. P(/)P(/)P(/) fails. Counterexample: put D = {(,), (,)}. Then clearly perm() and perm(), so that vN(P(/)) = 1 = vN(P(/)). But recalling
that there is no iteration of detachment in the definition of perm(), perm() so vN(P(/)) = 0. Conjunction in the consequent. P(/)P(/)P(/) fails, as it should. Counterexample: put D = {(,),(,)}. Then , perm() so vN(P(/)) = 1 = vN(P(/)). But as there is no head conjunction clause in the definition of perm(), () perm() so vN(P(/)) = 0. Contraposition. P(/)P(¬/¬) fails. Counterexample: paralleling that for obligation, put D = {(,)}. Then perm() so that vN(P(/)) = 1, but perm(¬) = so that vN(P(¬/¬)) = 0. Reflexivity. P(/) fails. Counterexample: paralleling that for obligation, put D = . Clearly perm() = for any condition . 7.4. Relating conditional and unconditional norms Unconditional obligation is deceptively ambiguous. It may be seen as a limiting case of conditional obligation where the condition is implicitly set at a familiar value. But the implicit value varies according to context and intention, giving rise to at least three different kinds of unconditional. On the one hand, as already observed by (von Wright 1968), we may understand " is obligatory" as saying that it is so under a condition representing zero information about the present world, i.e. we may take O as meaning O(/) where is a tautology. In contrast, we may understand it as saying that is obligatory under complete information about the present world, i.e. we may take O as meaning O(/V) where V is the set of all boolean formulae presently true. These are minimal and maximal readings. Between them, we may read O as saying that is obligatory under current information about the present world, i.e. as O(/X) where X is a set of boolean formulae representing the propositions known (alternatively: believed) about the world. As remarked by Alchourrуn (1993), formal work in the literature focuses almost exclusively on the "minimal" notion because of the formal simplicity of its definition, which moreover parallels the well-known definition of necessity from strict implication in modal logic. The other two notions have hardly been touched in formal accounts. For the "maximal" notion, Von Wright (1968) suggested introducing into the language a special propositional constant standing for the "actual" situation, defining O as O(/), and formulating axioms for to reflect its intended interpretation. However, as observed by Alchourrуn (1993), a satisfying formulation of such axioms is not immediate. For the "intermediate" notion, the author is not aware of any formal accounts in the literature, despite its evident importance. Intuitively, the "maximal" (resp. intermediate) notion expresses the idea that given the totality of facts true of the present world (resp. known or believed about the present world), a certain state of affairs should be brought about. It is important to notice the tensed character of the last part. If we ignore it, we not only miss part of the meaning, but we can also be led to the quite counterintuitive result that everything unconditionally obligatory is in fact true (resp. is not known to be false). In our definition of net output, in order to deal adequately with contrary-to-duty norms, we have required that an explicit promulgation may only be activated when its head is consistent with the
condition that is being entertained. Evidently, when the condition is a maxiconsistent set, then whatever is consistent with it is already an element of it. For this reason, in our view, it is not possible to give an even remotely credible account of the very important notions of obligation under complete or current information, without enlarging the formal language to represent the passage of time. Since the machinery of this paper abstracts from temporal considerations, we cannot here deal with those notions. In what follows we shall consider only obligation under zero information, with O defined as O(/), whilst recognising that it appears to be infrequent in ordinary usage. We consider two principles: conditionalisation and deontic modus ponens. Conditionalisation. This is the principle that an unconditional norm implies its conditional counterpart. For obligation it is OO(/) and for permission, PP(/). Given the definition of the unconditional operators, the status of each follows from that for strengthening the antecedent: the principle for permission fails without qualification, and that for obligation holds whenever out() = out*(), indeed when out*() - out(). Deontic modus ponens. This is the principle that from a conditional norm and some form of affirmation of its antecedent, we may infer its consequent. As is well known, it has two quite distinct forms: that in which the antecedent is affirmed unchanged, and that in which it is normed. In the former case, the principles are O(/)O and P(/)P, whereas in the latter case they are O(/)OO and P(/)PP. In the literature these are sometimes referred to as "factual" and "deontic" modus ponens respectively. However, in both cases the first conjunct of the antecedent of the principle remains a conditional norm, so that the principle retains an essentially deontic element. For this reason we prefer to describe both as forms of deontic modus ponens, distinguishing between those "with boolean minor" and those "with normative minor". Deontic modus ponens with boolean minor. P(/)P holds ­ but trivially, as a consequence of weakening the antecedent which gives us P(/)P(/). On the other hand, O(/)O fails. We can use the same counterexample as for contraposition, adding v() = 1. Deontic modus ponens with normative minor. These are the principles O(/)OO and P(/)PP. Given the definition of the unconditional operator, the status of each follows from that for transitivity. For obligation, we have immediately from transitivity that O(/)OO whenever out() = out*(). The local hypothesis out*() - out() also suffices. On the other hand, for permission this form of deontic detachment fails. We can use the same counterexample as for transitivity, but with = . 7.5. Relating conditional obligation to permission The relations between the conditional operators parallel exactly those in the unconditional case, described in section 2.4, with essentially the same verifications. The independent rules fail all of O(/)P(/), O(/)P(/)P(/), and P(/)¬O(¬/). The counterexamples are analogous to those in the unconditional case.
8. Open questions If the basic concepts developed in this paper are viable, then it may be of interest to follow through on a number of questions. Philosophical · Are there any anomalies in our definition of net output other than those that can be ascribed to changes in time or bearer? · Is the dependence of net output on the manner of formulation of the explicit conditional promulgations, a virtue as we have suggested, or a vice? · Given our intuitive understanding of strong permission (section 5), should we refine further the definition of perm(D,)? Comparative · It may be rewarding to compare our use of labels with that in the "labelled deontic logic" of van der Torre (1997), (van der Torre and Tan 1997), (van der Torre 1998). Two technical differences may already be noted. The presentation in van der Torre (1997) does not consider the parallel traces needed for dealing with reasoning by cases. Van der Torre (1998) takes account of this, but favours a variant labelling policy. Roughly speaking, rather than check the consistency of the current body with the current label, van der Torre prefers to put into the current label and check the latter for consistency. As he observes, this has the effect of making all subsequent consistency checks include the current body. This is illustrated by his example C = {(,), (,¬)}. Body disjunction gives out() with label {} for us, and with label {, ¬} for van der Torre. Body strengthening then gives out() with label {} for us, and this label is consistent with the condition . But van der Torre gets the same formula with label {(), ¬()}, one element of which is inconsistent, rendering the step illegitimate. · It may be instructive to consider the relationships between net output and extensions of a Reiter default system. Evidently, three distinguishing features of net output are that it does not have out(N,), it admits reasoning by cases, and it uses a derivation policy of "keep going until you hit trouble" rather than a fixpoint condition on the end product. In this connection, see also (Horty 1997). · Is there a possible worlds semantics for the iterative account? In section 1 we have already discussed a natural approach to this problem, and its shortcomings. Is it possible to do better? In the view of the author, the existence of a possible worlds semantics, or indeed of any kind of semantics, should not be treated as a touchstone. When available, a semantic characterisation can be technically useful and sometimes conceptually enlightening, but its absence is not necessarily a ground for rejection. If the iterative approach is on the right track · To minimize overheads, we have been working in a spartan environment: no attention to defeasible norms, instantiation and more generally quantifiers, passage of
time, human agency, bearers and counterparties of obligations, distributions of "burden of proof", representation of powers and competences ­ and whatever other dimensions that a comprehensive approach might require. From our discussions, it seems that the feature most urgently needing integration is the passage of time. Its intricacies should not be under-estimated. There are choices to be made on at least three levels. Two of these levels are already familiar from temporal logic itself - that of mathematical structure (e.g. whether to take time as discrete or continuous, branching or linear, whether to work with points or with intervals), and that of representation (e.g. whether to use tense operators or temporal indices, whether to operate on the latter with quantifiers or with functions). The third level, however, is more specific to our present context, and arises from the multiplicity of temporal patterns that may be intended when uttering conditional norms. Suppose for simplicity we are working with discrete time points, and consider an explicit promulgation (,). This may be understood in many different ways, for example: at the present moment (or: at any time from now on) if holds at that point (or: at some subsequent moment, or: at all subsequent moments) then at the next moment (or: some following moment, or: at all following moments, or: at all moments beyond some following one) is required to hold. This already gives twenty-four different temporal readings! According to the choice made, we will get quite different logics. For example, under the last reading of above, proof by cases will fail. Notes 1 Aware of this problem, some recent accounts of conditional obligation in terms of possible worlds introduce addenda into their valuation rules for O(./.) expressly in order to destroy the validity of O(/). However, the addenda are generally quite ad hoc. One exception is the possible worlds semantics sketched in section 7.2 of Makinson (1993). However, that account has other limitations. In particular, it validates strengthening of the antecedent, dealing insensitively with contrary-to-duty obligations. 2 In particular, Alchourrуn and Bulygin work with a set R of "explicitly rejected" formulae rather than a set B of explicitly permitted ones, and put vN(P) = 1 iff ¬ for some R. But the two are trivially equivalent, taking B = {¬: R} and R = {¬: B}. 3 The approach to conditional norms in this paper is fundamentally different from that in (Hansson and Makinson 1997). That paper works in a "naпve" or "pre-critical" frame, assuming that for the purposes of logic, norms may be treated as if they had truthvalues. It takes as given a consequence operation over formulae with deontic operators ­ whereas our purpose is to construct such a consequence operation in a manner that is consistent with the position that norms are neither true nor false. This basic difference of viewpoint gives rise to technical ones. In particular, in Hansson and Makinson (1997), the definition of a normative code allows deontic operators to appear in the heads (but not the bodies) of conditional promulgations. As a result of this asymmetry, the consequence operation may be used in place of detachment without authorizing contraposition or modus tollens. 4 There may be some connection between this distinction, and one made by van der Torre (1997, chapter 4) between "overriding" and "factual" defeasibility. There may also
be some connection between our distinction of net from gross output, and that made by (van der Torre and Tan 1998) between the contexts of "deliberation" and "justification". Acknowledgements Special thanks are due to Leendert van der Torre, whose thesis (1997) and insightful comments have been a source of inspiration at a number of critical junctures. Thanks are also due to Veronica Becher, Eugenio Bulygin, Dov Gabbay, Sven Ove Hansson, Lloyd Humberstone, Carlos Oller, Karl Schlechta, Marek Sergot, and an anonymous referee for their patient and helpful criticisms of drafts. Comments at ECSQARU/FAPR 97, IVR 97 and DEON 98 were also useful. References Alchourrуn, Carlos (1993). Philosophical foundations of deontic logic and the logic of defeasible conditionals. In Meyer, J.J. and R.J. Wieringa (eds) Deontic Logic in Computer Science, 43-84. Wiley: New York. Alchourrуn, Carlos & Eugenio Bulygin (1981). The expressive conception of norms. In Hilpinen, R. (ed.) New Essays in Deontic Logic, 95-124. Reidel: Dordrecht. Alchourrуn, Carlos & Eugenio Bulygin (1984). Pragmatic foundations for a logic of norms. Rechtstheorie 15: 453-464. Belzer, Marvin (1987). Legal reasoning in 3-D. In Proceedings of the First international conference in Artificial Intelligence and Law, 155-163. ACM Press: Boston. Carmo, Josй & Andrew J.I. Jones (1997). A new approach to contrary-to-duty obligations. In Nute, D. (ed.) Defeasible Deontic Logic, 317-344. Kluwer: Dordrecht. Chisholm, R.M. (1963). Contrary-to-duty imperatives and deontic logic. Analysis 24: 33-36. Dubislav, Walter (1937). Zur Unbegrьndbarkeit der Forderungsдtze. Theoria 3: 330342. Forrester, J.W. (1984). Gentle murder, or the adverbial Samaritan. Journal of Philosophy 81: 193-197. Gabbay, Dov (1996). Labelled Deductive Systems, vol. 1. Oxford University Press: Oxford. Hansson, Bengt (1969) An analysis of some deontic logics. Nous 3: 373-398. Reprinted in Hilpinen, R. (ed.) (1971 and 1981) Deontic Logic: Introductory and Systematic Readings, 121-147. Reidel: Dordrecht. Hansson, Sven Ove & David Makinson (1997). Applying normative rules with restraint. In Dalla Chiara, M.L. et al (eds) Logic and scientific methods, 313-332. Kluwer: Dordrecht. Horty, John F. (1997). Nonmonotonic foundations for deontic logic. In Nute, D. (ed.) Defeasible Deontic Logic, 17-43. Kluwer: Dordrecht. Jones, Andrew J.I. & Ingmar Pцrn (1985). Ideality, sub-ideality and deontic logic. Synthese 65: 273-290.
Jшrgensen, Jшrgen (1937-8). Imperatives and logic. Erkenntnis 7: 288-296. Kalinowski, Georges (1972). La logique des normes. Presses Universitaires de France: Paris. Loewer, B. & M. Belzer (1983). Dyadic deontic detachment. Synthese 54: 295-318. Makinson, David (1993). Five faces of minimality. Studia Logica 52: 339-379. Prakken, Henry & Marek Sergot (1996). Contrary-to-duty obligations. Studia Logica 57: 91-115. Prakken, Henry & Marek Sergot (1997). Dyadic deontic logic and contrary-to-duty obligations. In Nute, D. (ed.) Defeasible Deontic Logic, 223-262. Kluwer: Dordrecht. Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence 13: 81-132. Ross, Alf (1941). Imperatives and logic. Theoria 7: 53-71. Reprinted in philosophy of science (1944) 11: 30-46. Stenius, Erik (1963). Principles of a logic of normative systems. Acta Philosophica Fennica 16: 247-260. van der Torre, Leendert W.N. (1997). Reasoning about Obligations: Defeasibility in Preference-Based Deontic Logic. Ph.D. diss., Erasmus University of Rotterdam. Tinbergen Institute Research Series n° 140. Thesis Publishers: Amsterdam. van der Torre, Leendert W.N. (1998). Phased labeled logics of conditional goals. Manuscript to be presented at The First International Workshop on Labelled Deduction, Freiburg Germany, September 1998. van der Torre, Leendert W.N. & Yao-Hua Tan (1997). The many faces of defeasibility in defeasible deontic logic. In Nute, D. (ed.) Defeasible Deontic Logic, 79-122. Kluwer: Dordrecht. Van der Torre, Leendert W.N. & Yao-Hua Tan (1998). An update semantics for deontic reasoning. In McNamara, P. & H. Prakken (eds) Norms, Logics and Information Systems. New Studies on Deontic Logic and Computer Science. IOS Press: Amsterdam. von Wright, G.H. (1951). Deontic logic. Mind 60: 58-74. von Wright, G.H. (1964). A new system of deontic logic. Danish Yearbook of Philosophy 1: 173-182. Reprinted in Hilpinen, R. (ed.) (1971 and 1981) Deontic Logic: Introductory and Systematic Readings, 105-107. Reidel: Dordrecht. von Wright, G.H. (1968). An Essay on Deontic Logic and the General Theory of Action. North-Holland: Amsterdam.

### File:on-a-fundamental-problem-of-deontic-logic.pdfTitle: FunAuthor: DavidPublished: Wed Feb 28 23:52:47 2007Pages: 27File size: 0.16 Mb

, pages, 0 Mb

, pages, 0 Mb

2018 Ministry Guide, 15 pages, 0.23 Mb

Archive, 27 pages, 0.94 Mb