Ranking functions and rankings on languages
作者:
Highlights:
•
摘要
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.
论文关键词:Extension theorem for rankings on languages,Probabilities,Ranking functions,Rankings on languages,Spohn
论文评审过程:Received 8 June 2005, Revised 24 October 2005, Accepted 26 October 2005, Available online 21 November 2005.
论文官网地址:https://doi.org/10.1016/j.artint.2005.10.016