Authors:
- 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 and methods from the past two decades, appearing in book form for the first time
Part of the book series: Theory and Applications of Computability (THEOAPPLCOM)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Computable mathematics
-
Front Matter
-
-
Formalization and syntax
-
Front Matter
-
-
Combinatorics
-
Front Matter
-
-
Other areas
-
Front Matter
-
-
Back Matter
About this book
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.
Reviews
branches of mathematical logic.” (Huishan Wu, Mathematical Reviews, September, 2023)
Authors and Affiliations
-
Department of Mathematics, University of Connecticut, Storrs, USA
Damir D. Dzhafarov
-
Department of Mathematics, Marshall University, Huntington, USA
Carl Mummert
About the authors
Damir D. Dzhafarov is an Associate Professor of Mathematics at the University of Connecticut. He obtained his PhD from the University of Chicago, and has held postdoctoral positions at the University of Notre Dame and the University of California, Berkeley. He has held visiting positions at the National University of Singapore and Charles University, Prague. His research focuses on the computability theoretic and reverse mathematical aspects of of combinatorics, and on the interactions of reverse mathematics with computable analysis and other areas.
Carl Mummert is a Professor of Computer and Information Technology at Marshall Univeristy. He obtained his Ph.D. from Pennsylvania State University and held postdoctoral positions at Appalachian State University and the University of Michigan. His research has included the reverse mathematics of topology and combinatorics as well as higher order reverse mathematics.
Bibliographic Information
Book Title: Reverse Mathematics
Book Subtitle: Problems, Reductions, and Proofs
Authors: Damir D. Dzhafarov, Carl Mummert
Series Title: Theory and Applications of Computability
DOI: https://doi.org/10.1007/978-3-031-11367-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
Hardcover ISBN: 978-3-031-11366-6Published: 26 July 2022
Softcover ISBN: 978-3-031-11369-7Published: 26 July 2023
eBook ISBN: 978-3-031-11367-3Published: 25 July 2022
Series ISSN: 2190-619X
Series E-ISSN: 2190-6203
Edition Number: 1
Number of Pages: XIX, 488
Number of Illustrations: 1 b/w illustrations
Topics: Mathematics of Computing, Mathematical Logic and Foundations, Mathematical Logic and Foundations