Complementary relations in the theory of preference

Theory and Decision 7 (3):181-190 (1976)
  Copy   BIBTEX

Abstract

(1) This paper uses the following binary relations: > (is preferred to); ⩽ (is not preferred to); < (is less preferred than); ~ (is indifferent to). (2) Savage used primitive ⩾, postulated to be connected and transitive onA (the set of acts), to define the others: [x ~ y ⇔ (x ⩽ y and y ⩽ x)]; [y < x ⇔ notx ⩽ y]; [x > y ⇔ y < x]. Independently of the axioms, this definition implies that ⩽ and > are complementary relations onA: [x < y ⇔ notx > y]. (3) Pratt, Raiffa and Schlaifer used primitive ⩽, postulated to be transitive onL (the set of lotteries), to define the others with a different expression for <: [x < y ⇔ (x ⩽ y and noty ⩽ x)]. Thus, ⩽ and > are not necessarily complementary onL; since ⩽ is not postulated to be connected onL, but connected ⩽ is necessary and sufficient for such complementarity. Since the restriction of ⩽ to the subsetA ofL is connected, ⩽ and > are complementary onA. (4) Fishburn used primitive < onA to define the others with different expression for ~ and ⩽: [x ~ y ⇔ (notx < y and noty < x)]; [x ⩽ y ⇔ (x < y orx ~ y)]. His version of Savage's theory then assumed that < is asymmetric and negatively transitive onA. Thus, ⩽ and > are complementary, since asymmetric < is necessary and sufficient for such complementarity. (5) This analysis provides a new proof that the same list of elementary properties of binary relations onA applies to all three theories: ⩽ is connected, transitive, weakly connected, reflexive, and negatively transitive; while both < and > are asymmetric, negatively transitive, antisymmetric, irreflexive, and transitive; but only ~ is symmetric

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On transitive subrelations of binary relations.Christopher S. Hardin - 2011 - Journal of Symbolic Logic 76 (4):1429-1440.
Complementary properties of binary relations.Raymond H. Burros - 1975 - Theory and Decision 6 (2):177-183.
The Deep Side of Preference Theory.Antoine Billot - 2002 - Theory and Decision 53 (3):243-270.
Syllogistic Logic with Comparative Adjectives.Lawrence S. Moss - 2011 - Journal of Logic, Language and Information 20 (3):397-417.
Antifoundation and Transitive Closure in the System of Zermelo.Olivier Esser & Roland Hinnion - 1999 - Notre Dame Journal of Formal Logic 40 (2):197-205.
Abstraction Relations Need Not Be Reflexive.Jonathan Payne - 2013 - Thought: A Journal of Philosophy 2 (2):137-147.
A multimodal logic for reasoning about complementarity.Ivo Düntsch & Beata Konikowska - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):273-301.

Analytics

Added to PP
2013-12-01

Downloads
37 (#374,850)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

References found in this work

The Foundations of Statistics.Leonard J. Savage - 1954 - Wiley Publications in Statistics.
Introduction to logic.Patrick Suppes - 1957 - Mineola, N.Y.: Dover Publications.
Introduction to Logic.Roland Hall - 1960 - Philosophical Quarterly 10 (40):287-288.
Complementary properties of binary relations.Raymond H. Burros - 1975 - Theory and Decision 6 (2):177-183.

Add more references