Ordinal Conditional Functions. A Dynamic Theory of Epistemic States

In W. L. Harper & B. Skyrms (eds.), Causation in Decision, Belief Change, and Statistics, vol. II. Kluwer Academic Publishers (1988)
Abstract
It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,749
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Reducing Belief Simpliciter to Degrees of Belief.Hannes Leitgeb - 2013 - Annals of Pure and Applied Logic 164 (12):1338-1389.
Degrees All the Way Down: Beliefs, Non-Beliefs and Disbeliefs.Hans Rott - 2009 - In Franz Huber & Christoph Schmidt-Petri (eds.), Degrees of Belief. Springer. pp. 301--339.
Logic Based Merging.Konieczny Sébastien & Pino Pérez Ramón - 2011 - Journal of Philosophical Logic 40 (2):239-270.
The Consistency Argument for Ranking Functions.Franz Huber - 2007 - Studia Logica 86 (2):299-329.

View all 18 citations / Add more citations

Similar books and articles
Added to PP index
2009-07-26

Total downloads
1 ( #913,402 of 2,197,362 )

Recent downloads (6 months)
1 ( #298,877 of 2,197,362 )

How can I increase my downloads?

Monthly downloads

Sorry, there are not enough data points to plot this chart.
My notes
Sign in to use this feature