We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£118.94
This is the most expensive it has ever been. Walk away.
£119 today · previous high £119 · all-time low £117
Springer Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)
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 31 days · 31 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 31 days • 3 price levels
Price Analysis
Most common price: £118 (19 days, 61.3%)
Price range: £117 - £119
Price levels: 3 different prices over 31 days
Description
Product Specifications
- Brand
- Springer
- Format
- paperback
- ASIN
- 9048152984
- Domain
- Amazon UK
- Release Date
- 06 December 2010
- Listed Since
- 14 June 2010
Barcode
No barcode data available
Similar Products You Might Like
Higher Recursion Theory 2 - Perspectives in Logic Series
Cambridge University Press
Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)
Elsevier
Wiley Thinking Recursively - Computer Science Textbook
Wiley
COMPUTATIONAL PROSPECTS OF INFINITY - PART II: PRESENTED TALKS: 15 (LECTURE NOTES SERIES, INSTITUTE FOR MATHEMATICAL SCIENCES, NATIONAL UNIVERSITY OF SINGAPORE)
Scientific Publishing
Models of Peano Arithmetic: 15 (Oxford Logic Guides)
Oxford University Press
COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (LECTURE NOTES SERIES, INSTITUTE FOR MATHEMATICAL SCIENCES, NATIONAL UNIVERSITY OF SINGAPORE)
Scientific Publishing
Mathematics in Programming
Springer
Computability and Logic
Cambridge University Press
Recursion Theory: Lecture Notes in Logic 1 (Aatdf Monographs)
Routledge
Constructive Models (Siberian School of Algebra and Logic)
Springer
Constructive Models (Siberian School of Algebra and Logic)
Springer
Gödel's Incompleteness Theorems: 19 (Oxford Logic Guides)
Oxford University Press
Computability
Springer
Introduction to Metamathematics (Bibliotheca Mathematica)
North Holland
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Gödel's Incompleteness Theorems: A Guided Tour Through Kurt Gödel’s Historic Proof
Springer
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Mathematical Logic: 291 (Graduate Texts in Mathematics, 291)
Springer