Process Reliabilism, Prime Numbers and the Generality Problem

Logos and Episteme 11 (2):231-236 (2020)
  Copy   BIBTEX

Abstract

This paper aims to show that Selim Berker’s widely discussed prime number case is merely an instance of the well-known generality problem for process reliabilism and thus arguably not as interesting a case as one might have thought. Initially, Berker’s case is introduced and interpreted. Then the most recent response to the case from the literature is presented. Eventually, it is argued that Berker’s case is nothing but a straightforward consequence of the generality problem, i.e., the problematic aspect of the case for process reliabilism (if any) is already captured by the generality problem.

Author Profiles

Frederik J. Andersen
University of Copenhagen
Klemens Kappel
University of Copenhagen

Analytics

Added to PP
2020-07-01

Downloads
533 (#27,915)

6 months
130 (#22,337)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?