Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability) - Image 1

£48.61

Springer Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

Name: Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)
Brand: Springer
Price: 48.61 GBP
Availability: InStock

Computer Science

This is the most expensive it has ever been. Walk away.

£49 today · previous high £49 · all-time low £40

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 78 days • 78 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 78 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £40 (58 days, 74.4%)

Price range: £40 - £49

Price levels: 2 different prices over 78 days

Description

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.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 3031113667
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 26 July 2022
Listed Since: 17 June 2022

Barcode

No barcode data available

Springer Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Springer - Reverse Mathematics: Problems, Reductions, and Proofs

Proofs and Computations (Perspectives in Logic)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)

Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)

Combinators, λ-Terms and Proof Theory: 42 (Synthese Library, 42)

Mathematical Foundations of Computer Science

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

The Discrete Mathematical Charms of Paul Erdos: A Simple Introduction

Logique mathématique - Tome 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles: T 2 - Fonctions récursives, théorème de Gödel, théorie des ensembles

Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory: 53 (Trends in Logic, 53)

Constructive Models (Siberian School of Algebra and Logic)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

Springer Well-Quasi Orders in Computation, Logic and Reasoning

Constructive Models (Siberian School of Algebra and Logic)

A First Course in Mathematical Logic and Set Theory

MATHEMATICAL LOGIC OTIL PAPER: 3 (Oxford Texts in Logic)

Basic Discrete Mathematics: Logic, Set Theory, and Probability

Models of Peano Arithmetic: 15 (Oxford Logic Guides)

An Introduction to Mathematical Proofs (Textbooks in Mathematics)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification

An Introduction to Ramsey Theory: Fast Functions, Infinity, and Metamathematics (Student Mathematical Library)