Skip to main content
SpringerLink
Log in

Modal Logic for Preference Based on Reasons

  • Chapter
In Search of Elegance in the Theory and Practice of Computation

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8000))

Abstract

We discuss the logic of preferences, introducing modal connectives that reflect reasons to prefer that one formula rather than another be true. An axiomatic analysis of two such logics is presented.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Andréka, H., Ryan, M., Schobbens, P.-Y.: Operators and laws for combining preferential relations. Journal of Logic and Computation 12, 12–53 (2002)

    Article  Google Scholar 

  • Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)

    Google Scholar 

  • Dietrich, F., List, C.: A reason-based theory of rational choice. Technical Report, London School of Economics (2009)

    Google Scholar 

  • Hansson, S.O.: A new semantical approach to the logic of preference. Erkenntnis 31(1), 1–42 (1989)

    Article  Google Scholar 

  • Keeney, R.L., Raiffa, H.: Decisions with Multiple Objectives: Preferences and Value Trade-Offs. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  • Krantz, D.H., Luce, R.D., Suppes, P., Tversky, A.: Foundations of Measurement, vol. I. Academic Press, New York (1971)

    MATH  Google Scholar 

  • Kripke, S.: The undecidability of monadic modal quantification theory. Zeitschr. f. math. Logik und Grundlagen d. Math. 8, 113–116 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  • Lang, J., van der Torre, L., Weydert, E.: Hidden uncertainty in the logical representation of desires. In: Proceedings of Eighteenth International Joint Conference on Artificial Intelligence, IJCAI 2003 (2003)

    Google Scholar 

  • Liu, F.: Changing for the Better: Preference Dynamics and Agent Diversity. PhD thesis, ILLC, University of Amsterdam (2008)

    Google Scholar 

  • Osherson, D., Weinstein, S.: Preference based on reasons. The Review of Symbolic Logic 5(1), 122–147 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  • Reny, P.J.: Arrow’s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach. Economics Letters 70, 99–105 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Rescher, N.: Semantic foundations for a the logic of preference. In: The Logic of Decision and Action, University of Pittsburgh Press (1967)

    Google Scholar 

  • Stalnaker, R.: A theory of conditionals. In: Rescher, N. (ed.) Studies in Logical Theory. Blackwell, Oxford (1968)

    Google Scholar 

  • van Benthem, J., Girard, P.K., Roy, O.: Everything else being equal: A modal logic for Ceteris Paribus preferences. Journal of Philosophical Logic 38, 83–125 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Princeton University, Princeton, NJ, 08544, USA

    Daniel Osherson

  2. University of Pennsylvania, Philadelphia, PA, 19104, USA

    Scott Weinstein

Authors
  1. Daniel Osherson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Scott Weinstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut St., 19104, Philadelphia, PA, USA

    Val Tannen

  2. School of Computing, National University of Singapore, 13 Computing Drive, 117417, Singapore, Singapore

    Limsoon Wong

  3. School of Informatics, The University of Edinburgh, 10 Crichton Street, EH8 9AB, Edinburgh, UK

    Leonid Libkin , Wenfei Fan  & Michael Fourman ,  & 

  4. Department of Computer Science, University of California, 1156 High Street, 95064, Santa Cruz, CA, USA

    Wang-Chiew Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Osherson, D., Weinstein, S. (2013). Modal Logic for Preference Based on Reasons. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41660-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41659-0

  • Online ISBN: 978-3-642-41660-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation