We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£88.57
This is the most expensive it has ever been. Walk away.
£89 today · previous high £89 · all-time low £88
Springer Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Perspectives in Mathematical Logic)
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 36 days · 36 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 36 days • 2 price levels
Price Analysis
Most common price: £88 (30 days, 83.3%)
Price range: £88 - £89
Price levels: 2 different prices over 36 days
Description
Product Specifications
- Brand
- Springer
- Format
- paperback
- ASIN
- 3540666818
- Domain
- Amazon UK
- Publication Date
- 23 August 2014
- Listed Since
- 16 January 2014
Barcode
No barcode data available
Similar Products You Might Like
Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8
De Gruyter
Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)
Springer
The Foundations of Computability Theory
Springer
LMS: 45 Recursion Theory, Applns: Its Generalisations & Applications, Proceedings of Logic Colloquim '79, Leeds, Aug. 1979 (London Mathematical Society Lecture Note Series, Series Number 45)
Cambridge University Press
Super-Recursive Algorithms (Monographs in Computer Science)
Springer
Theories of Computability
Cambridge University Press
Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48
Cambridge University Press
Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)
Springer
Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)
Birkhauser
Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)
Springer
Computability and Models: Perspectives East and West (University Series in Mathematics)
Springer
Introduction to Annotated Logics: Foundations for Paracomplete and Paraconsistent Reasoning: 88 (Intelligent Systems Reference Library, 88)
Springer
Introduction to Annotated Logics: Foundations for Paracomplete and Paraconsistent Reasoning: 88 (Intelligent Systems Reference Library, 88)
Springer
Lectures in Logic and Set Theory: Volume 2, Set Theory: 83 (Cambridge Studies in Advanced Mathematics, Series Number 83)
Cambridge University Press
Probabilistic Extensions of Various Logical Systems
Springer
Formal Methods for Nonmonotonic and Related Logics: Vol II: Theory Revision, Inheritance, and Various Abstract Properties: 2
Springer
Reasoning with Rough Sets: Logical Approaches to Granularity-Based Framework: 142 (Intelligent Systems Reference Library, 142)
Springer
Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)
Springer
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications: 145 (Studies in Computational Intelligence, 145)
Springer
Logics for Computer Science: Classical and Non-Classical
Springer
Logic Functions and Equations: Binary Models for Computer Science
Springer
Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997: 2 (De Gruyter Series in Logic & its Applications, 2)
De Gruyter
Theory Of Named Sets (Mathematics Research Developments)
Price unavailable
First-Order Programming Theories: 24 (Monographs in Theoretical Computer Science. An EATCS Series, 24)
Springer