Ranking Functions and Rankings on Languages

Artificial Intelligence 170:462-471 (2006)
Download Edit this record How to cite View on PhilPapers
Abstract
The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking functions are only indirectly—via a pointwise ranking function on the underlying set of possibilities W —defined on a field of propositions A over W. This research note shows under which conditions ranking functions on a field of propositions A over W and rankings on a language L are induced by pointwise ranking functions on W and the set of models for L, ModL, respectively.
Keywords
No keywords specified (fix it)
PhilPapers/Archive ID
HUBRFA
Revision history
Archival date: 2014-07-09
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Hempel’s Logic of Confirmation.Franz Huber - 2008 - Philosophical Studies 139 (2):181-189.
The Consistency Argument for Ranking Functions.Franz Huber - 2007 - Studia Logica 86 (2):299-329.
New Foundations for Counterfactuals.Franz Huber - 2014 - Synthese 191 (10):2167-2193.
Belief Revision II: Ranking Theory.Franz Huber - 2013 - Philosophy Compass 8 (7):613-621.
The Logic of Theory Assessment.Franz Huber - 2007 - Journal of Philosophical Logic 36 (5):511-538.

View all 7 citations / Add more citations

Added to PP index
2009-01-28

Total views
153 ( #16,158 of 37,218 )

Recent downloads (6 months)
22 ( #15,851 of 37,218 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.