Mendeley出力
Reverse Mathematics : Problems, Reductions, and Proofs / by Damir D. Dzhafarov, Carl Mummert
(Theory and Applications of Computability, In cooperation with the association Computability in Europe. ISSN:21906203)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2022. |
| 出版者 | (Cham : Springer International Publishing : Imprint: Springer) |
| 出版年 | 2022 |
| 大きさ | XIX, 488 p. 1 illus : online resource |
| 著者標目 | *Dzhafarov, Damir D author Mummert, Carl author SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | 1 introduction -- Part I Computable mathematics: 2 Computability theory -- 3 Instance–solution problems -- 4 Problem reducibilities -- Part II Formalization and syntax: 5 Second order arithmetic -- 6 Induction and bounding -- 7 Forcing -- Part III Combinatorics: 8 Ramsey’s theorem -- 9 Other combinatorial principles -- Part IV Other areas: 10 Analysis and topology -- 11 Algebra -- 12 Set theory and beyond 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 two decades, appearing in book form for the first time and including preservation techniques and applications of probabilistic arguments Includes a large number of exercises of varying levels of difficulty, supplementing each chapter The text will be accessible to students with a standard first year course in mathematical logic. It will also be a useful reference for researchers in reverse mathematics, computability theory, proof theory, and related areas. Damir D. Dzhafarov is an Associate Professor of Mathematics at the University of Connecticut, CT, USA. Carl Mummert is a Professor of Computer and Information Technology at Marshall University, WV, USA HTTP:URL=https://doi.org/10.1007/978-3-031-11367-3 |
|---|---|
| 件 名 | LCSH:Computer science -- Mathematics
全ての件名で検索
LCSH:Computable functions LCSH:Recursion theory LCSH:Mathematical logic FREE:Mathematics of Computing FREE:Computability and Recursion Theory FREE:Mathematical Logic and Foundations |
| 分 類 | LCC:QA76.9.M35 DC23:004.0151 |
| 書誌ID | EB00001756 |
| ISBN | 9783031113673 |
類似資料
この資料の利用統計
このページへのアクセス回数：8回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降