The Consistency Argument for Ranking Functions penultimate version: please cite the paper in Studia Logica
Franz Huber · 2006
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, which says that an entrenchment function gives rise to consistent and deductively closed beliefs iff it satisfies the ranking axioms. The Consistency Argument is extended to various ranktheoretic update rules.