東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Reverse mathematics = problems, redu...

Dzhafarov, Damir D.

Linked to FindBook

Google Book

Amazon

博客來

Reverse mathematics = problems, reductions, and proofs /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Reverse mathematics/ by Damir D. Dzhafarov, Carl Mummert.
Reminder of title:	problems, reductions, and proofs /
Author:	Dzhafarov, Damir D.
other author:	Mummert, Carl.
Published:	Cham :Springer International Publishing : : 2022.,
Description:	xix, 488 p. :ill., digital ;24 cm.
Notes:	Ramsey's theorem for singletons.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Reverse mathematics. -
Online resource:	https://doi.org/10.1007/978-3-031-11367-3
ISBN:	9783031113673

Reverse mathematics = problems, reductions, and proofs /
Dzhafarov, Damir D.

Reverse mathematicsproblems, reductions, and proofs /[electronic resource] :by Damir D. Dzhafarov, Carl Mummert. - Cham :Springer International Publishing :2022. - xix, 488 p. :ill., digital ;24 cm. - Theory and applications of computability, in cooperation with the association computability in Europe,2190-6203. - Theory and applications of computability, in cooperation with the association computability in Europe..

Ramsey's theorem for singletons.

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.

ISBN: 9783031113673

Standard No.: 10.1007/978-3-031-11367-3doiSubjects--Topical Terms:

2142335
Reverse mathematics.

LC Class. No.: QA9.25 / .D94 2022

Dewey Class. No.: 511.3

Reverse mathematics = problems, reductions, and proofs /
LDR:03440nmm a2200349 a 4500 001 2302464
003 DE-He213
005 20220725113419.0
006 m d
007 cr nn 008maaau
008 230409s2022 sz s 0 eng d
020 $a 9783031113673 $q (electronic bk.)
020 $a 9783031113666 $q (paper)
024 7 $a 10.1007/978-3-031-11367-3 $2 doi
035 $a 978-3-031-11367-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.25 $b .D94 2022
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 511.3 $2 23
090 $a QA9.25 $b .D999 2022
100 1 $a Dzhafarov, Damir D. $3 3602805
245 1 0 $a Reverse mathematics $h [electronic resource] : $b problems, reductions, and proofs / $c by Damir D. Dzhafarov, Carl Mummert.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a xix, 488 p. : $b ill., digital ; $c 24 cm.
490 1 $a Theory and applications of computability, in cooperation with the association computability in Europe, $x 2190-6203
500 $a Ramsey's theorem for singletons.
505 0 $a 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.
520 $a 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.
650 0 $a Reverse mathematics. $3 2142335
650 1 4 $a Mathematics of Computing. $3 891213
650 2 4 $a Computability and Recursion Theory. $3 3602807
650 2 4 $a Mathematical Logic and Foundations. $3 892656
700 1 $a Mummert, Carl. $3 3602806
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Theory and applications of computability, in cooperation with the association computability in Europe. $3 2162489
856 4 0 $u https://doi.org/10.1007/978-3-031-11367-3
950 $a Computer Science (SpringerNature-11645)