We can't find the internet
Attempting to reconnect
Something went wrong!
Hang in there while we get back on track
£117.58
Springer Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)
Price data last checked 132 day(s) ago - refreshing...
We'll watch every seller, every day. One email when your price arrives.
This is the usual price. Wait for it to drop, or tell us your number.
£118 today · usual range £0–£0 · best ever £51
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 History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 599 days • 599 data points (No recent data available)
Price Distribution
Price distribution over 599 days • 9 price levels
Price Analysis
Most common price: £107 (140 days, 23.4%)
Price range: £51 - £119
Price levels: 9 different prices over 599 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
Cambridge Higher Recursion Theory 2 - Perspectives in Logic
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)
North Holland
Computability: An Introduction to Recursive Function Theory
Cambridge University Press
Recursion Theory, Godel's Theorems, Set Theory, Model Theory (Mathematical Logic: A Course With Exercises, Part II)
Oxford University Press
Inexhaustibility: A Non-Exhaustive Treatment: Lecture Notes in Logic 16
Routledge
Thinking Recursively
Wiley
Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)
North Holland
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
Mathematical Logic and Theoretical Computer Science: 106 (Lecture Notes in Pure and Applied Mathematics)
CRC Press
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
Recursion Theory: Lecture Notes in Logic 1
CRC Press
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)
CRC Press