Is there a well-founded solution to the generality problem?

被引:9
|
作者
Matheson, Jonathan D. [1 ]
机构
[1] Univ N Florida, Jacksonville, FL 32224 USA
关键词
Reliabilism; Evidentialism; Generality problem; Justification; Epistemology; RELIABILISM;
D O I
10.1007/s11098-014-0312-1
中图分类号
B [哲学、宗教];
学科分类号
01 ; 0101 ;
摘要
The generality problem is perhaps the most notorious problem for process reliabilism. Several recent responses to the generality problem have claimed that the problem has been unfairly leveled against reliabilists. In particular, these responses have claimed that the generality problem is either (i) just as much of a problem for evidentialists, or (ii) if it is not, then a parallel solution is available to reliabilists. Along these lines, Juan Comesaa has recently proposed solution to the generality problem-well-founded reliabilism. According to Comesaa, the solution to the generality problem lies in solving the basing problem, such that any solution to the basing problem will give a solution to the generality problem. Comesaa utilizes Conee and Feldman's evidentialist account of basing (Conee and Feldman's well-foundedness principle) in forming his version of reliabilism. In this paper I show that Comesaa's proposed solution to the generality problem is inadequate. Well-founded reliabilism both fails to solve the generality problem and subjects reliabilism to new damning verdicts. In addition, I show that evidentialism does not face any parallel problems, so the generality problem remains a reason to prefer evidentialism to reliabilism.
引用
收藏
页码:459 / 468
页数:10
相关论文
共 50 条
  • [21] Is this Well-founded Olympic Politics?
    Herzog, Markwart
    GERMAN JOURNAL OF EXERCISE AND SPORT RESEARCH, 2010, 40 (03) : 213 - 216
  • [22] A NONDETERMINISTIC WELL-FOUNDED SEMANTICS
    TORRES, A
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (01) : 37 - 73
  • [23] Well-founded coalgebras, revisited
    Jeannin, Jean-Baptiste
    Kozen, Dexter
    Silva, Alexandra
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2017, 27 (07) : 1111 - 1131
  • [24] RECURSIVE WELL-FOUNDED ORDERINGS
    CHEN, KH
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (05): : A506 - A506
  • [25] Paramodulation with Well-founded Orderings
    Bofill, Miquel
    Rubio, Albert
    JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (02) : 263 - 302
  • [26] IS FREUD THEORY WELL-FOUNDED
    GRUNBAUM, A
    BEHAVIORAL AND BRAIN SCIENCES, 1986, 9 (02) : 266 - 281
  • [27] A Well-Founded Semantics with disjunction
    Alcântara, J
    Damásio, CV
    Pereira, LM
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 341 - 355
  • [28] ARE CRITICISMS OF EXERCISE WELL-FOUNDED
    SHEPHARD, RJ
    CANADIAN FAMILY PHYSICIAN, 1986, 32 : 139 - &
  • [29] Aggregation and well-founded semantics
    Osorio, M
    Jayaraman, B
    NON-MONOTONIC EXTENSIONS OF LOGIC PROGRAMMING, 1997, 1216 : 71 - 90
  • [30] Possibilistic Well-Founded Semantics
    Osorio, Mauricio
    Carlos Nieves, Juan
    MICAI 2009: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5845 : 15 - +