Ranking Functions and Rankings on Languages

Artificial Intelligence 170:462-471 (2006)
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)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive Franz Huber, Ranking Functions and Rankings on Languages
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.

Citations of this work BETA
Franz Huber (2008). Hempel's Logic of Confirmation. Philosophical Studies 139 (2):181 - 189.
Emil Weydert (2012). Conditional Ranking Revision. Journal of Philosophical Logic 41 (1):237-271.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

26 ( #66,551 of 1,101,088 )

Recent downloads (6 months)

5 ( #59,135 of 1,101,088 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.