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

Skip to content

Reverse Mathematics: Problems, Reductions, and Proofs

Reverse Mathematics: Problems, Reductions, and Proofs

Reverse Mathematics: Problems, Reductions, and Proofs
Stock photo: cover may vary

Reverse Mathematics: Problems, Reductions, and Proofs Paperback / softback - 2023

by Damir D. Dzhafarov

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New.

Reverse mathematics studies the complexity of proving mathematical theorems and solving mathematical problems.

Ask the seller a question Add to wish list
A$74.26
A$19.21 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

  • Title Reverse Mathematics: Problems, Reductions, and Proofs
  • Author Damir D. Dzhafarov
  • Binding Paperback
  • Condition New
  • Pages 488
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2023-07-26
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # B9783031113697
  • 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 10

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Reverse Mathematics: Problems, Reductions, and Proofs

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.


tracking-