找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Reverse Mathematics; Problems, Reductions Damir D. Dzhafarov,Carl Mummert Textbook 2022 The Editor(s) (if applicable) and The Author(s), un

[复制链接]
查看: 28244|回复: 46
发表于 2025-3-21 19:05:47 | 显示全部楼层 |阅读模式
书目名称Reverse Mathematics
副标题Problems, Reductions
编辑Damir D. Dzhafarov,Carl Mummert
视频video
概述Offers a comprehensive treatment of the reverse mathematics of combinatorics.Includes a large number of exercises of varying levels of difficulty, supplementing each chapter.Provides central results a
丛书名称Theory and Applications of Computability
图书封面Titlebook: Reverse Mathematics; Problems, Reductions Damir D. Dzhafarov,Carl Mummert Textbook 2022 The Editor(s) (if applicable) and The Author(s), un
描述.Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems. Typical questions include: Can we prove this result without first proving that one? Can a computer solve this problem? A highly active part of mathematical logic and computability theory, the subject offers beautiful results as well as significant foundational insights..This text provides a modern treatment of reverse mathematics that combines computability theoretic reductions and proofs in formal arithmetic to measure the complexity of theorems and problems from all areas of mathematics. It includes detailed introductions to techniques from computable mathematics, Weihrauch style analysis, and other parts of computability that have become integral to research in the field. .Topics and features.:.Provides a complete introduction to reverse mathematics, including necessary background from computability theory, second order arithmetic, forcing, induction, and model construction.Offers a comprehensive treatment of the reverse mathematics of combinatorics, including Ramsey‘s theorem, Hindman‘s theorem, and many other results.Provides central results and methods from the past
出版日期Textbook 2022
关键词Reverse mathematics; Computability theory; Second-order arithmetic; Continuous mathematics; Sequence cod
版次1
doihttps://doi.org/10.1007/978-3-031-11367-3
isbn_softcover978-3-031-11369-7
isbn_ebook978-3-031-11367-3Series ISSN 2190-619X Series E-ISSN 2190-6203
issn_series 2190-619X
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Reverse Mathematics影响因子(影响力)




书目名称Reverse Mathematics影响因子(影响力)学科排名




书目名称Reverse Mathematics网络公开度




书目名称Reverse Mathematics网络公开度学科排名




书目名称Reverse Mathematics被引频次




书目名称Reverse Mathematics被引频次学科排名




书目名称Reverse Mathematics年度引用




书目名称Reverse Mathematics年度引用学科排名




书目名称Reverse Mathematics读者反馈




书目名称Reverse Mathematics读者反馈学科排名




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

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:27:56 | 显示全部楼层
发表于 2025-3-22 00:31:18 | 显示全部楼层
发表于 2025-3-22 04:45:15 | 显示全部楼层
Second order arithmetic if we temporarily assume as an axiom that a problem P is solvable, how difficult is it to . that a second problem Q is solvable? If we can prove that Q is solvable under the assumption that P is solvable, this gives us information that Q is “weaker” than P, at least modulo the other axioms used in
发表于 2025-3-22 10:02:53 | 显示全部楼层
发表于 2025-3-22 15:09:40 | 显示全部楼层
发表于 2025-3-22 17:58:41 | 显示全部楼层
Set theory and beyond”.We cannot easily talk about . (equivalence classes of well orderings) as such in Z., but many properties of the ordinals can be formulated in terms of specific well orderings instead. We have already seen that ATR. can express many such properties quite naturally. In this chapter, we investigate a
发表于 2025-3-22 22:26:51 | 显示全部楼层
发表于 2025-3-23 04:27:49 | 显示全部楼层
发表于 2025-3-23 05:35:18 | 显示全部楼层
Problem reducibilitiesr does not, then we may view the latter as “harder” from a certain computational standpoint. But it is not obvious how to find such a class for a particular pair of problems, or whether such a class even exists. It is also unclear what relationship this kind of classification really expresses.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-12 07:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表