Studia Logica

, Volume 86, Issue 2, pp 299–329

The Consistency Argument for Ranking Functions

Article

DOI: 10.1007/s11225-007-9062-9

Cite this article as:
Huber, F. Stud Logica (2007) 86: 299. doi:10.1007/s11225-007-9062-9

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.

Keywords

Conditionalization Conditional Consistency Consistency Consistency Argu­ment Consistency Theorem Deductive Closure Dutch Book Argument Ranking Func­tions Probability Measures Revision Spohn Update Rule 

Copyright information

© Springer Science+Business Media B.V. 2007

Authors and Affiliations

  1. 1.Division of Humanities and Social SciencesCalifornia Institute of TechnologyPasadenaUSA

Personalised recommendations