Details

Title Reverse Mathematics Problems Reductions And Proofs (Pb 2022)
Author Dzhafarov D.D
Binding Paperback
Condition New
Pages 488
Volumes 1
Language ENG
Publisher Springer
Publication date 2023-07-26
Illustrated Yes
Features Illustrated
Bookseller's Inventory # C--8549
ISBN 9783031113697 / 3031113691
Weight 1.56 lbs (0.71 kg)
Dimensions 9.21 x 6.14 x 1.03 in (23.39 x 15.60 x 2.62 cm)
Category Computers - General Information
Quantity available 1

About FBS California, United States

Biblio member since 2023

I have a book store in location California. we are keep used and new books.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from FBS

Reader reviews for Reverse Mathematics Problems Reductions And Proofs (Pb 2022)

Write a review for this book

Important Terms and Guidelines

Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
Reviews must be at least 140 characters in length.
Please do not reveal critical plot elements.
This is not a help line. Contact customer support if you need help.

Your review must not include:

Obscenities, discriminatory language, or other insulting language not suitable for public domain
Advertisements, “spam” content, or references to other products, offers or websites.
Email addresses, URLs, phone numbers, physical addresses or other contact information.
Overly critical comments about other reviews or reviewers
Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
Availability, price, or alternative ordering/shipping information

From the publisher

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.

From the rear cover

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.

About the author

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.

BIBLIO is the largest independent book marketplace in the world, with over 100 million books.