Ranking functions and rankings on languages

Citation data:

Artificial Intelligence, ISSN: 0004-3702, Vol: 170, Issue: 4, Page: 462-471

Publication Year:
2006
Usage 179
Downloads 169
Abstract Views 10
Captures 12
Readers 11
Exports-Saves 1
Citations 10
Citation Indexes 10
Repository URL:
http://philsci-archive.pitt.edu/id/eprint/10850
DOI:
10.1016/j.artint.2005.10.016
Author(s):
Franz Huber
Publisher(s):
Elsevier BV, Elsevier
Tags:
Computer Science
article description
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.

This article has 0 Wikipedia mention.