Process Reliabilism, Prime Numbers and the Generality Problem

Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
ANDPRP-3
Upload history
First archival date: 2020-07-01
Latest version: 2 (2020-07-01)
View other versions
Added to PP index
2020-07-01

Total views
37 ( #45,845 of 51,415 )

Recent downloads (6 months)
37 ( #15,544 of 51,415 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.