The Consistency Argument for Ranking Functions

Citation data:

Studia Logica, ISSN: 0039-3215, Vol: 86, Issue: 2, Page: 299-329

Publication Year:
2007
Usage 192
Downloads 176
Abstract Views 16
Captures 13
Readers 10
Exports-Saves 3
Social Media 1
Tweets 1
Citations 7
Citation Indexes 7
Repository URL:
http://philsci-archive.pitt.edu/id/eprint/10848
DOI:
10.1007/s11225-007-9062-9
Author(s):
Huber, Franz
Publisher(s):
Springer Nature, Springer
Tags:
Mathematics
Most Recent Tweet View All Tweets
article description
The paper provides an argument for the thesis that an agent's degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem. The latter says that an agent's belief set is and will always be consistent and deductively closed iff her degrees of entrenchment satisfy the ranking axioms and are updated according to the ranktheoretic update rules. © 2007 Springer Science+Business Media B.V.

This article has 0 Wikipedia mention.