Skip to main content

Deontic Modals with Complex Acts

  • Conference paper
  • First Online:
Modeling and Using Context (CONTEXT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9405))

  • 896 Accesses

Abstract

The paper identifies a key pragmatic principle that is responsible for the information-sensitivity of deontic modals. Information-sensitivity has been extensively discussed in the recent linguistic and philosophical literature, in connection with a decision problem known as the Miners’ puzzle (Kolodny and MacFarlane 2010). I argue that the so-called Ellsberg paradox (Ellsberg 1961) is a more general source of information-sensitivity. Then I outline a unified pragmatic solution to both puzzles on the basis of a well-known decision procedure (MiniMax).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In the standard modal semantics (Kratzer 2012), the consequent of such an entailment is a proposition in the ordering source, while the antecedent is the proposition in the scope of the deontic modals. Roughly, the more consequent-propositions in the ordering source follow from the antecedent-proposition, the more deontically valuable the antecedent-proposition is.

  2. 2.

    In decision-theoretic terms, complex acts and outcomes are obtained by putting together the information in the estimated desirability matrix of a decision problem. More precisely, we could gather the information on a specific row of a matrix (which corresponds to an act), or by considering for deliberation a combination of rows (acts) of the matrix (cf. Jeffrey 1965/1983). For completeness, the outcomes—seen as entailments of the acts—should be weighted with the probabilities of the relevant conditions, but we shall leave this information implicit.

  3. 3.

    It is natural to stipulate that acts, viewed as propositions, should be non-empty, and thus should have at least one element (i.e., world).

  4. 4.

    See also Fishburn (1986) and Halpern (2005) for further discussion.

  5. 5.

    Notation: \(R\), \(B\), and \(Y\) stand for red, blue, and yellow balls. \(R > B\) means that there are more red balls than blue ones, or that \(R\) is more probable than \(B\). Because the outcomes of the acts are equal, the probabilistic relation \(>\) translates into a preference relation \(\succ \) (but not vice-versa). So \(R > B\) means that choosing red is more probable than choosing blue, but can also read as saying that the former is preferable to the latter. Finally, the disjunctions should be interpreted as inclusive, unless either ... or-phrases are used. E.g. opting for \(R \vee B\) brings about the prize if any of the red or blue balls is then randomly drawn. (The same could be expressed in terms of conjunction, if we interpreted the letters as bets on colours, because e.g. choosing blue or yellow will amount to betting on blue and yellow.).

  6. 6.

    A version of the puzzle can be stated even if we assume that the deontic necessity modal ought to requires a strict preference relation. To do this, we assume that one of the following should hold: \(B>Y\), \(Y>B\), or \(Y=B\). We then formulate three conditionals having these three statements as antecedents. For instance, we’ll have the new conditional: If \(Y=B\), we ought to be indifferent between the three options. (The other two conditionals will be like (6)-(7), but formulated in terms of the strict relation, \(>\).) It then follows by disjunctive syllogism that we ought to choose \(B\), \(Y\), or \(R\), which contradicts (3).

  7. 7.

    Complementarity does not hold in (E) either. Complementarity requires that if \(A \succ B\), then \(\lnot A \preceq \lnot B\), where \(\succ , \preceq \) etc. are preference relations. Yet \(R \succ B\), but \(\lnot R = B \vee Y \succ \lnot B = R \vee Y\), and so complementarity is violated.

  8. 8.

    For experimental evidence that the pattern of reasoning is robust see references in Camerer and Weber (1992, 332ff.).

  9. 9.

    In natural language semantics, additivity has been invoked as evidence for introducing a quantitative probability measure to account for (epistemic) probabilistic modals, and against the standard Kratzer-semantics of those modals (Lassiter 2010, Yalcin 2010).

  10. 10.

    In Nasta (2015b) I call this property instability and show that it holds of preferences and deontic commitments in general.

  11. 11.

    E.g. in (M), blocking shaft \(A\) dominates the other two acts under the condition that the miners are in shaft \(A\).

  12. 12.

    This decision procedure is closely related to the minimax regret rule invoked in rational choice theory; see Levi (1980, 144ff.) for discussion and references.

  13. 13.

    I discuss more extensively the role of disjunction in settings (M) and (E) in Nasta (2015a).

  14. 14.

    See von Fintel (2012, pp.28–29) for relevant evidence of this type. This evidence suggests that conditionals admit of implicit restrictors which are sensitive to local pragmatic implications. Such local pragmatic (coherence-based) implication exists in several other linguistic domains (cf. Simons 2014).

  15. 15.

    Though see Carr (2012) and Lassiter (2011), who directly approach the miners’ puzzle, and Goble (1996) whose deontic logic account may constitute a good framework for dealing with both (M) and (E).

  16. 16.

    On the one hand, it is easy to check that MiniMax gets a good prediction for the conjunctive act of blocking both shafts in (M), and for the act of choosing a red ball in (E). On the other hand, it is much more difficult to come up with a sharp comparison between the disjunctive acts \(B_a \vee B_b\), \(B_a \vee B_n\), and \(B_b \vee B_n\). The latter two acts guarantee that either no miner will be saved or nine miners will be saved or all of them will be saved (\(S_0 \vee S_9 \vee S_{10}\)), whilst the former act guarantees that either zero or ten miners will be saved (\(S_0 \vee S_{10}\)). A first problem is that in order to estimate the desirabilities of the acts we have to come up with probabilities for the disjuncts. And even after doing that, it is not clear that there will be only one obvious way of choosing between the estimated desirabilities thus obtained.

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrei Nasta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Nasta, A. (2015). Deontic Modals with Complex Acts. In: Christiansen, H., Stojanovic, I., Papadopoulos, G. (eds) Modeling and Using Context. CONTEXT 2015. Lecture Notes in Computer Science(), vol 9405. Springer, Cham. https://doi.org/10.1007/978-3-319-25591-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25591-0_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25590-3

  • Online ISBN: 978-3-319-25591-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics