找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Incompleteness for Higher-Order Arithmetic; An Example Based on Yong Cheng Book 2019 The Author(s), under exclusive license to Springer Na

[复制链接]
查看: 36288|回复: 35
发表于 2025-3-21 19:18:29 | 显示全部楼层 |阅读模式
书目名称Incompleteness for Higher-Order Arithmetic
副标题An Example Based on
编辑Yong Cheng
视频video
丛书名称SpringerBriefs in Mathematics
图书封面Titlebook: Incompleteness for Higher-Order Arithmetic; An Example Based on  Yong Cheng Book 2019 The Author(s), under exclusive license to Springer Na
描述Gödel‘s true-but-unprovable sentence from the first incompleteness theorem is purely logical in nature, i.e. not mathematically natural or interesting. An interesting problem is to find mathematically natural and interesting statements that are similarly unprovable. A lot of research has since been done in this direction, most notably by Harvey Friedman. A lot of examples of concrete incompleteness with real mathematical content have been found to date. This brief contributes to Harvey Friedman‘s research program on concrete incompleteness for higher-order arithmetic and gives a specific example of concrete mathematical theorems which is expressible in second-order arithmetic but the minimal system in higher-order arithmetic to prove it is fourth-order arithmetic..This book first examines the following foundational question: are all theorems in classic mathematics expressible in second-order arithmetic provable in second-order arithmetic? The author gives a counterexample for this question and isolates this counterexample from the Martin-Harrington Theorem in set theory. It shows that the statement “Harrington‘s principle implies zero sharp" is not provable in second-order arithmet
出版日期Book 2019
关键词Incompleteness; higher order arithmetic; Harrington‘s Principle; Set Theory; Martin-Harrington Theorem; L
版次1
doihttps://doi.org/10.1007/978-981-13-9949-7
isbn_softcover978-981-13-9948-0
isbn_ebook978-981-13-9949-7Series ISSN 2191-8198 Series E-ISSN 2191-8201
issn_series 2191-8198
copyrightThe Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2019
The information of publication is updating

书目名称Incompleteness for Higher-Order Arithmetic影响因子(影响力)




书目名称Incompleteness for Higher-Order Arithmetic影响因子(影响力)学科排名




书目名称Incompleteness for Higher-Order Arithmetic网络公开度




书目名称Incompleteness for Higher-Order Arithmetic网络公开度学科排名




书目名称Incompleteness for Higher-Order Arithmetic被引频次




书目名称Incompleteness for Higher-Order Arithmetic被引频次学科排名




书目名称Incompleteness for Higher-Order Arithmetic年度引用




书目名称Incompleteness for Higher-Order Arithmetic年度引用学科排名




书目名称Incompleteness for Higher-Order Arithmetic读者反馈




书目名称Incompleteness for Higher-Order Arithmetic读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:36:38 | 显示全部楼层
The Boldface Martin-Harrington Theorem in , ., . exists. In this chapter, I prove the Boldface Martin-Harrington Theorem in . . In Sect. ., I prove in . that if for any real . exists, then . holds. In Sect. ., I prove in . that . implies that for any real ., . exists.
发表于 2025-3-22 02:53:04 | 显示全部楼层
发表于 2025-3-22 05:48:18 | 显示全部楼层
Introduction and Preliminaries,., . and .. This should provide the reader with a good picture of the background and put the main results in this book into perspective. In Sect. ., I review some of the notions and facts from Set Theory used in this book. In Sect. ., I introduce the main research problems and outline the structure of this book.
发表于 2025-3-22 12:21:50 | 显示全部楼层
The Boldface Martin-Harrington Theorem in , ., . exists. In this chapter, I prove the Boldface Martin-Harrington Theorem in . . In Sect. ., I prove in . that if for any real . exists, then . holds. In Sect. ., I prove in . that . implies that for any real ., . exists.
发表于 2025-3-22 13:00:40 | 显示全部楼层
发表于 2025-3-22 17:50:59 | 显示全部楼层
A Minimal System,In this chapter, we prove the following results..As a corollary, “.implies that .exists” is neither provable in .nor in ., i.e. .is the minimal system of higher-order arithmetic for proving that “.implies that . exists”.
发表于 2025-3-23 00:03:40 | 显示全部楼层
发表于 2025-3-23 04:03:36 | 显示全部楼层
发表于 2025-3-23 08:13:03 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-17 20:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表