The Consistency Argument for Ranking Functions
- Citation data:
Studia Logica, ISSN: 0039-3215, Vol: 86, Issue: 2, Page: 299-329
- Publication Year:
- Mathematics; Arts and Humanities
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.