首页> 外文学位 >Arithmetical knowledge and arithmetical definability: Four studies.
【24h】

Arithmetical knowledge and arithmetical definability: Four studies.

机译:算术知识和算术可定义性:四项研究。

获取原文
获取原文并翻译 | 示例

摘要

The subject of this dissertation is arithmetical knowledge and arithmetical definability. The first two chapters contain respectively a critique of a logicist account of a preferred means by which we may legitimately infer to arithmetical truths and a tentative defense of an empiricist account. According to the logicist account, one may infer from quasi-logical truths to patently arithmetical truths because the arithmetical truths are representable in the logical truths. It is argued in the first chapter that this account is subject to various problems: for instance, the most straightforward versions seem vulnerable to various counterexamples. The basic idea of the alternative empiricist account considered in chapter two is that complicated arithmetical truths like mathematical induction may be inferred by way of confirmation from less complicated quantifier-free arithmetical truths. The notion of confirmation here is understood probabilistically, and responses are given in this chapter to several seeming problems with this importation of probability into arithmetic.;The final two chapters are concerned with arithmetical definability in two different settings. In the third chapter, the interpretability strength of the arithmetical and hyperarithmetical subsystems of second-order Peano arithmetic is compared to the interpretability strength of analogous systems centered around two principles called Hume's Principle and Basic Law V, which respectively axiomatize a standard notion of cardinality and an alternative conception of set. One of the major results of this chapter is that the hyperarithmetic subsystem of Hume's Principle does not interpret the hyperarithmetic subsystem of second-order Peano arithmetic. The fourth chapter is concerned with arithmetical definability in the setting of descriptive set theory, where the relevant benchmark is between notions which may be defined without quantification over elements of certain topological spaces (Borel notions) and notions whose definitions do require such quantification (analytic, coanalytic, projective notions). In this fourth chapter the Denjoy integral is studied from the vantage point of descriptive set theory, and it is shown that the graph of the indefinite integral is not Borel but rather is properly coanalytic. This contrasts to the Lebesgue integral, which is Borel under this measure of complexity.
机译:本文的主题是算术知识和算术可定义性。前两章分别批评了逻辑学家对一种首选手段的批评,通过这种手段我们可以合理地推断出算术真理,并初步地对经验主义者的观点进行辩护。根据逻辑学家的说法,因为算术真理在逻辑真理中是可表示的,所以可以从准逻辑真理推断为专利的算术真理。在第一章中,论证了这种说法会遇到各种问题:例如,最直接的版本似乎容易受到各种反例的攻击。在第二章中考虑的替代经验主义解释的基本思想是,可以通过从不太复杂的无量词的算术真理中进行确认来推断出像数学归纳法这样的复杂算术真理。确认的概念在概率上得到理解,并且在本章中针对将概率输入到算术中的一些看似问题给出了响应。最后两章涉及两种不同设置中的算术可定义性。在第三章中,将二阶Peano算术的算术和超算术子系统的可解释性强度与类似系统的可解释性强度进行了比较,类似系统围绕着休'原理和基本法则V这两个原理公理了基数和集的替代概念。本章的主要结果之一是,休ume原理的超算术子系统没有解释二阶Peano算术的超算术子系统。第四章涉及描述性集合论理论中的算术可定义性,其中相关基准位于可以不对某些拓扑空间的元素进行量化的定义之间的概念(桶概念)和其定义确实需要进行量化的概念之间(解析,协同分析,投影概念)。在第四章中,从描述集理论的角度研究了Denjoy积分,并且证明了不定积分的图不是Borel而是适当的协分析图。这与Lebesgue积分形成对比,后者在这种复杂性度量下为Borel。

著录项

  • 作者

    Walsh, Sean.;

  • 作者单位

    University of Notre Dame.;

  • 授予单位 University of Notre Dame.;
  • 学科 Mathematics.;Philosophy.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 334 p.
  • 总页数 334
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号