Artículo
Confirmational holism and theory choice: Arrow meets Duhem
Fecha de publicación:
01/2019
Editorial:
Oxford University Press
Revista:
Mind
ISSN:
0026-4423
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
In a recent paper Samir Okasha has suggested an application of Arrow's impossibility theorem to theory choice. When epistemic virtues are interpreted as "voters" in charge of ranking competing theories, and there are more than two theories at stake, the final ordering is bound to coincide with the one proposed by one of the voters (the dictator), provided a number of seemingly reasonable conditions are in place. In a similar spirit, Jacob Stegenga has shown that Arrow's theorem applies to the amalgamation of evidence; the "voters" here are the different sources of evidence. As with Okasha's proposal, it is not clear how to avoid Arrow's pessimistic conclusion.In this paper we develop a novel argument that purports to show that, in typical examples, Arrow's result does not obtain when dealing with evidence amalgamation. The reason is that we cannot escape the well-known Duhem problem: the evidence actually confirms (or disconfirms) complex conjunctions that include various auxiliary hypotheses. We argue that confirmational holism induces us to restrict the domain of a reasonable amalgamation function, thus violating one of Arrow's conditions. The upshot is that we are now able to see the Duhem problem under a different, positive light – namely, as a phenomenon that makes the aggregation of the evidence possible in the first place, when there are at least three options on the table.
Palabras clave:
Confirmational holism
,
Theory choice
,
Arrow theorem
,
Social Choice
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(IIF)
Articulos de INSTITUTO DE INVESTIGACIONES FILOSOFICAS
Articulos de INSTITUTO DE INVESTIGACIONES FILOSOFICAS
Citación
Cresto, Eleonora Beatriz; Tajer, Diego; Confirmational holism and theory choice: Arrow meets Duhem; Oxford University Press; Mind; 129; 513; 1-2019; 71-111
Compartir