We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£34.41
It has never been this cheap. We have no record of a lower price.
£34 today · cheaper than every other day in the last 3 months
Springer Reverse Mathematics: Problems, Reductions, and Proofs
We'll watch every seller, every day. One email when your price arrives.
Price History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 80 days · 80 data points (no recent data)
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
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
name your number, we'll email you
Price Distribution
Price distribution over 80 days • 5 price levels
Price Analysis
Most common price: £44 (46 days, 57.5%)
Price range: £34 - £47
Price levels: 5 different prices over 80 days
Description
Key Features
Reverse Mathematics combines computability theory with formal arithmetic to measure theorem complexity across mathematical domains.
The text addresses whether mathematical results can be proven independently and what computational resources theorems actually require.
This Springer publication explores foundational insights into mathematical logic by studying the relationships between different proof systems.
The book applies reductions from computability theory to determine the inherent difficulty of mathematical problems and proofs.
Product Specifications
- Brand
- Springer
- Format
- paperback
- ASIN
- 3031113691
- Domain
- Amazon UK
- Release Date
- 26 July 2023
- Listed Since
- 29 June 2023
Barcode
No barcode data available
Similar Products You Might Like
Reverse Mathematics: Problems, Reductions, and Proofs (Theory and Applications of Computability)
Springer
Proofs and Computations (Perspectives in Logic)
Cambridge University Press
Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)
Springer
An Introduction to Mathematical Proofs (Textbooks in Mathematics)
CRC Press
Fundamentals of Logic and Computation: With Practical Automated Reasoning and Verification (Texts in Computer Science)
Springer
Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)
Springer
Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Cambridge Studies in Advanced Mathematics, Series Number 82)
Cambridge University Press
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
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
DUNOD
Combinators, λ-Terms and Proof Theory: 42 (Synthese Library, 42)
Springer
Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)
Birkhauser
Concise Guide to Formal Methods: Theory, Fundamentals and Industry Applications (Undergraduate Topics in Computer Science)
Springer
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)
Springer
Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)
Logic of Mathematics: A Modern Course of Classical Logic: 22 (Pure and Applied Mathematics: A Wiley Series of Texts, Monographs and Tracts)
Wiley
Computability and Randomness: 51 (Oxford Logic Guides)
Oxford University Press
Well-Quasi Orders in Computation, Logic, Language - Springer
Springer
Cambridge University Press - Discrete Mathematical Charms of Paul Erd s
Cambridge University Press
An Introduction to Mathematical Proofs (Textbooks in Mathematics)
CRC Press
Mathematical Foundations of Computer Science
Chapman and Hall/CRC
A First Course in Mathematical Logic and Set Theory
Wiley
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Basic Discrete Mathematics: Logic, Set Theory, and Probability
World Scientific Publishing Company