PhilSci Archive

The Consistency Argument for Ranking Functions

Huber, Franz (2007) The Consistency Argument for Ranking Functions. Studia Logica, 86 (2). pp. 299-329.

[img]
Preview
PDF
new_version.pdf

Download (332kB)

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, 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.


Export/Citation: EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
Social Networking:
Share |

Item Type: Published Article or Volume
Creators:
CreatorsEmailORCID
Huber, Franzfranz.huber@utoronto.ca
Subjects: General Issues > Confirmation/Induction
General Issues > Decision Theory
Specific Sciences > Probability/Statistics
General Issues > Theory Change
Depositing User: Unnamed user with email franz.huber@utoronto.ca
Date Deposited: 09 Jul 2014 14:37
Last Modified: 09 Jul 2014 14:37
Item ID: 10848
Journal or Publication Title: Studia Logica
Publisher: Springer
Official URL: http://link.springer.com/article/10.1007%2Fs11225-...
Subjects: General Issues > Confirmation/Induction
General Issues > Decision Theory
Specific Sciences > Probability/Statistics
General Issues > Theory Change
Date: 2007
Page Range: pp. 299-329
Volume: 86
Number: 2
URI: https://philsci-archive-dev.library.pitt.edu/id/eprint/10848

Monthly Views for the past 3 years

Monthly Downloads for the past 3 years

Plum Analytics

Actions (login required)

View Item View Item