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
On the Logic of Theory Change: Partial Meet Contraction and Revision Functions.Alchourrón, Carlos E.; Gärdenfors, Peter & Makinson, David

View all 6 references / Add more references

Citations of this work BETA
Ranking Theory.Huber, Franz

View all 11 citations / Add more citations

Added to PP index
2009-01-28

Total views
169 ( #17,680 of 40,678 )

Recent downloads (6 months)
20 ( #24,940 of 40,678 )

How can I increase my downloads?

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