國立虎尾科技大學 |

Reverse Mathematics = Problems, Reductions, and Proofs /

Record Type:	Language materials, printed : 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.
Description:	XIX, 488 p. 1 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—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. - 1st ed. 2022. - XIX, 488 p. 1 illus.online resource. - 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,.

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:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Reverse Mathematics = Problems, Reductions, and Proofs /
LDR:03749nam a22004095i 4500 001 1088951
003 DE-He213
005 20220725113419.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031113673 $9 978-3-031-11367-3
024 7 $a 10.1007/978-3-031-11367-3 $2 doi
035 $a 978-3-031-11367-3
050 4 $a QA76.9.M35
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a UYAM $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Dzhafarov, Damir D. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1396183
245 1 0 $a Reverse Mathematics $h [electronic resource] : $b Problems, Reductions, and Proofs / $c by Damir D. Dzhafarov, Carl Mummert.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIX, 488 p. 1 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theory and Applications of Computability, In cooperation with the association Computability in Europe, $x 2190-6203
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 Computer science—Mathematics. $3 1253519
650 0 $a Computable functions. $3 677058
650 0 $a Recursion theory. $3 575916
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Computability and Recursion Theory. $3 1396185
650 2 4 $a Mathematical Logic and Foundations. $3 669393
700 1 $a Mummert, Carl. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1396184
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031113666
776 0 8 $i Printed edition: $z 9783031113680
776 0 8 $i Printed edition: $z 9783031113697
830 0 $a Theory and Applications of Computability, In cooperation with the association Computability in Europe, $x 2190-619X $3 1262393
856 4 0 $u https://doi.org/10.1007/978-3-031-11367-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)