Abstract

The main issue in the epistemology of peer disagreement is whether known disagreement among those who are in symmetrical epistemic positions undermines the rationality of their maintaining their respective views. Douven and Kelp have argued convincingly that this problem is best understood as being about how to respond to peer disagreement repeatedly over time, and that this diachronic issue can be best approached through computer simulation. However, Douven and Kelp’s favored simulation framework cannot naturally handle Christensen’s famous Mental Math example. As a remedy, I introduce an alternative (Bayesian) simulation framework, Laputa, inspired by Alvin Goldman’s seminal work on veritistic social epistemology. I show that Christensen’s conciliatory response, reasonably reconstructed and supplemented, gives rise to an increase in epistemic (veritistic) value only if the peers continue to recheck their mental math; else the peers might as well be steadfast. On a meta-level, the study illustrates the power of Goldman’s approach when combined with simulation techniques for handling the computational issues involved.

Highlights

  • Two individuals are epistemic peers with respect to some question if and only if they are equals with respect to (1) their familiarity with the evidence and arguments which bear on that question and (2) general epistemic virtues such as intelligence, thoughtfulness, and freedom from bias (Kelly 2006, p. 175)

  • Plausible cases of known peer disagreement include examples from law and science, such as when the Supreme Court is divided in a difficult legal case or when distinguished professors in paleontology disagree about what killed the dinosaurs

  • Issues about the legalization of drugs have been mentioned in this connection because “[i]ntelligent, well-informed, well-meaning, seemingly reasonable people have markedly different views on this topic” (Feldman 2006, p. 218), and philosophy is the area of known peer disagreement par excellence

Read more

Summary

Introduction

Two individuals are epistemic peers with respect to some question if and only if they are equals with respect to (1) their familiarity with the evidence and arguments which bear on that question and (2) general epistemic virtues such as intelligence, thoughtfulness, and freedom from bias (Kelly 2006, p. 175). There are, as one can imagine, two main answers to this question: yes, known peer disagreement does undermine the rationality of the respective views; no, it does not. The diachronic approach focuses on strategies for how to react to peer disagreement over the long run rather than on mere one-shot cases The latter turn out to be less important than is commonly assumed. Douven and Kelp argue that the diachronic case is best investigated through computer simulation, in contrast to the a priori methodology usually employed by epistemologists. Their simulation framework cannot convincingly handle Christensen’s famous Mental Math example. I introduce an alternative simulation framework, Laputa, which relies on Alvin Goldman’s seminal work on veritistic value (Goldman 1999), and I show how the example can be diachronically addressed in this other setting in line with Christensen’s conciliatory recommendation (with some steadfast qualifications)

Douven and Kelp on diachronic peer disagreement
Problems for the diachronic approach
Enter Laputa: an alternative simulation framework
The synchronic and diachronic completeness of Laputa
Simulating peer disagreement in Laputa
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.