We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£58.83
It has never been this cheap. We have no record of a lower price.
£59 today · cheaper than every other day in the last 3 months
Scientific Publishing COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (LECTURE NOTES SERIES, INSTITUTE FOR MATHEMATICAL SCIENCES, NATIONAL UNIVERSITY OF SINGAPORE)
Price data last checked 35 day(s) ago - refreshing...
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 56 days · 56 data points (no recent data)
Price data last checked 35 day(s) ago - refreshing...
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 56 days • 3 price levels
Price Analysis
Most common price: £66 (28 days, 50.0%)
Price range: £59 - £67
Price levels: 3 different prices over 56 days
Description
Product Specifications
- Brand
- Scientific Publishing
- Format
- hardcover
- ASIN
- 9812796533
- Domain
- Amazon UK
- Release Date
- 14 July 2008
- Listed Since
- 03 March 2008
Barcode
No barcode data available
Similar Products You Might Like
COMPUTATIONAL PROSPECTS OF INFINITY - PART II: PRESENTED TALKS: 15 (LECTURE NOTES SERIES, INSTITUTE FOR MATHEMATICAL SCIENCES, NATIONAL UNIVERSITY OF SINGAPORE)
Scientific Publishing
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
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)
Springer
Higher Recursion Theory 2 - Perspectives in Logic Series
Cambridge University Press
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity
CRC Press
Models of Peano Arithmetic: 15 (Oxford Logic Guides)
Oxford University Press
Introduction to Metamathematics (Bibliotheca Mathematica)
North Holland
Mathematical Foundations of Computer Science
Chapman and Hall/CRC
Logic and Combinatorics: Joint Summer Research Conference on Applications of Mathematical Logic to Finite Combinatorics (Contemporary Mathematics)
Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)
Cambridge University Press
Mathematics in Programming
Springer
Constructive Models (Siberian School of Algebra and Logic)
Springer
Constructive Models (Siberian School of Algebra and Logic)
Springer
Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)
Computability and Logic
Cambridge University Press
Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)
Springer
Finite Structures with Few Types: 152 (Annals of Mathematics Studies, 152)
Princeton University Press
Turing Computability: Theory and Applications (Theory and Applications of Computability)
Springer
Finite and Infinite Combinatorics in Sets and Logic: 411 (Nato Science Series C:, 411)
Springer