Inferring a linear ordering over a power set

Theory and Decision 51 (1):31-49 (2001)
  Copy   BIBTEX

Abstract

An observer attempts to infer the unobserved ranking of two ideal objects, A and B, from observed rankings in which these objects are `accompanied' by `noise' components, C and D. In the first ranking, A is accompanied by C and B is accompanied by D, while in the second ranking, A is accompanied by D and B is accompanied by C. In both rankings, noisy-A is ranked above noisy-B. The observer infers that ideal-A is ranked above ideal-B. This commonly used inference rule is formalized for the case in which A,B,C,D are sets. Let X be a finite set and let be a linear ordering on 2X. The following condition is imposed on . For every quadruple (A,B,C,D)∈Y, where Y is some domain in (2X)4, if and , then . The implications and interpretation of this condition for various domains Y are discussed

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

The dense linear ordering principle.David Pincus - 1997 - Journal of Symbolic Logic 62 (2):438-456.
Notes and Comments.Brian Mcneil - 1938 - New Scholasticism 12 (2):197-198.
Ranking Functions and Rankings on Languages.Franz Huber - 2006 - Artificial Intelligence 170 (4-5):462-471.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
On modelling vagueness—and on not modelling incommensurability.Robert Sugden - 2009 - Aristotelian Society Supplementary Volume 83 (1):95-113.
Non-prioritized ranked belief change.Samir Chopra, Aditya Ghose & Thomas Meyer - 2003 - Journal of Philosophical Logic 32 (4):417-443.
On the Analysis of Negative Freedom.Martin van Hees - 1998 - Theory and Decision 45 (2):175-197.
Definable Open Sets As Finite Unions of Definable Open Cells.Simon Andrews - 2010 - Notre Dame Journal of Formal Logic 51 (2):247-251.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.

Analytics

Added to PP
2010-09-02

Downloads
75 (#215,841)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references