The Consistency Argument for Ranking Functions

Studia Logica 86 (2):299-329 (2007)
  Copy   BIBTEX

Abstract

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.

Author's Profile

Franz Huber
University of Toronto, St. George Campus

Analytics

Added to PP
2009-01-28

Downloads
487 (#33,028)

6 months
97 (#40,334)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?