A non-probabilist principle of higher-order reasoning

被引:0
|
作者
William J. Talbott
机构
[1] University of Washington,Department of Philosophy
来源
Synthese | 2016年 / 193卷
关键词
Higher-order reasoning; Probabilism; Bayesianism ; Dutch book; Calibration; Logical omniscience; Epistemic akrasia; Fallibilism;
D O I
暂无
中图分类号
学科分类号
摘要
The author uses a series of examples to illustrate two versions of a new, nonprobabilist principle of epistemic rationality, the special and general versions of the metacognitive, expected relative frequency (MERF) principle. These are used to explain the rationality of revisions to an agent’s degrees of confidence in propositions based on evidence of the reliability or unreliability of the cognitive processes responsible for them—especially reductions in confidence assignments to propositions antecedently regarded as certain—including certainty-reductions to instances of the law of excluded middle or the law of noncontradiction in logic or certainty-reductions to the certainties of probabilist epistemology. The author proposes special and general versions of the MERF principle and uses them to explain the examples, including the reasoning that would lead to thoroughgoing fallibilism—that is, to a state of being certain of nothing (not even the MERF principle itself). The author responds to the main defenses of probabilism: Dutch Book arguments, Joyce’s potential accuracy defense, and the potential calibration defenses of Shimony and van Fraassen by showing that, even though they do not satisfy the probability axioms, degrees of belief that satisfy the MERF principle minimize expected inaccuracy in Joyce’s sense; they can be externally calibrated in Shimony and van Fraassen’s sense; and they can serve as a basis for rational betting, unlike probabilist degrees of belief, which, in many cases, human beings have no rational way of ascertaining. The author also uses the MERF principle to subsume the various epistemic akrasia principles in the literature. Finally, the author responds to Titelbaum’s argument that epistemic akrasia principles require that we be certain of some epistemological beliefs, if we are rational.
引用
收藏
页码:3099 / 3145
页数:46
相关论文
共 50 条
  • [21] Higher-order approximations in the averaging principle of multiscale systems
    Li, Xin
    Wang, Qiuyu
    Xie, Longjie
    APPLIED MATHEMATICS LETTERS, 2023, 142
  • [22] HIGHER-ORDER (NON-)MODULARITY
    Appel, Claus
    van Oostrom, Vincent
    Simonsen, Jakob Grue
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 17 - 32
  • [23] Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
    Prost, Frederic
    Zerrari, Chaouki
    UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2009, 5715 : 219 - +
  • [24] Hybrid: Reasoning with Higher-Order Abstract Syntax in Coq and Isabelle
    Felty, Amy P.
    MSFP 2010: PROCEEDINGS OF THE 2010 ACM SIGPLAN WORKSHOP ON MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING, 2010, : 1 - 1
  • [25] Towards 'up to context' reasoning about higher-order processes
    Durier, Adrien
    Hirschkoff, Daniel
    Sangiorgi, Davide
    THEORETICAL COMPUTER SCIENCE, 2020, 807 : 154 - 168
  • [26] Modular Reasoning about Concurrent Higher-Order Imperative Programs
    Birkedal, Lars
    ACM SIGPLAN NOTICES, 2014, 49 (01) : 1 - 1
  • [27] Correctness of a higher-order removal transformation through a relational reasoning
    Nishimura, S
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2003, 2895 : 358 - 375
  • [28] Higher-Order Intentionality and Higher-Order Acquaintance
    Benj Hellie
    Philosophical Studies, 2007, 134 : 289 - 324
  • [29] IS TEACHING STILL POSSIBLE, WRITING, MEANING, AND HIGHER-ORDER REASONING
    BERTHOFF, AE
    COLLEGE ENGLISH, 1984, 46 (08) : 743 - 755
  • [30] Automated Reasoning in Higher-Order Logic using the TPTP THE Infrastructure
    Sutcliffe, Geoff
    Benzmueller, Christoph
    JOURNAL OF FORMALIZED REASONING, 2010, 3 (01): : 1 - 27