Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143) - Image 1

£115.00

North Holland Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

Name: Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)
Brand: North Holland
Price: 115.0 GBP
Availability: InStock

bibliography, indices

Information Systems

This is the most expensive it has ever been. Walk away.

£115 today · previous high £115 · all-time low £114

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

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
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 584 days • 584 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 584 days • 1 price levels

Days at Price

Price Analysis

Most common price: £115 (584 days, 100.0%)

Price range: £115 - £115

Price levels: 1 different prices over 584 days

Description

Volume II of Classical Recursion Theory describes the universe from a local (bottom-upor synthetical) point of view, and covers the whole spectrum, from therecursive to the arithmetical sets.The first half of the book provides a detailed picture of the computablesets from the perspective of Theoretical Computer Science. Besides giving adetailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexityclasses, ranging from small time and space bounds to the elementary functions,with a particular attention to polynomial time and space computability. It alsodeals with primitive recursive functions and larger classes, which are ofinterest to the proof theorist. The second half of the book starts with the classical theory of recursivelyenumerable sets and degrees, which constitutes the core of Recursion orComputability Theory. Unlike other texts, usually confined to the Turingdegrees, the book covers a variety of other strong reducibilities, studyingboth their individual structures and their mutual relationships. The lastchapters extend the theory to limit sets and arithmetical sets. The volumeends with the first textbook treatment of the enumeration degrees, whichadmit a number of applications from algebra to the Lambda Calculus.The book is a valuable source of information for anyone interested inComplexity and Computability Theory. The student will appreciate the detailedbut informal account of a wide variety of basic topics, while the specialistwill find a wealth of material sketched in exercises and asides. A massivebibliography of more than a thousand titles completes the treatment on thehistorical side.

Product Specifications

Brand: North Holland
Model: bibliography, indices
Format: Hardcover
ASIN: 044450205X
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 11 September 1999
Listed Since: 02 January 2007

Barcode

No barcode data available

North Holland Classical Recursion Theory, Volume II (Volume 143) (Studies in Logic and the Foundations of Mathematics, Volume 143)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computability: An Introduction to Recursive Function Theory

COMPUTATIONAL PROSPECTS OF INFINITY - PART I: TUTORIALS (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers: Volume 125 (Studies in Logic and the Foundations of Mathematics, Volume 125)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Computability Theory: An Introduction to Recursion Theory

Theory of Computation

Computability

Introduction to Metamathematics (Bibliotheca Mathematica)

Computability Theory: 26 (Chapman Hall/CRC Mathematics Series)

What Can Be Computed? – A Practical Guide to the Theory of Computation

Computability Theory and Its Applications: Current Trends and Open Problems (Contemporary Mathematics)

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems: 286 (Synthese Library, 286)

Cambridge Higher Recursion Theory 2 - Perspectives in Logic

The Foundations of Computability Theory

Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Computability and Logic

Effective Mathematics of the Uncountable: 41 (Lecture Notes in Logic, Series Number 41)

Mathematics in Programming

COMPUTATIONAL PROSPECTS OF INFINITY - PART II: PRESENTED TALKS: 15 (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Turing Computability: Theory and Applications (Theory and Applications of Computability)

Constructive Models (Siberian School of Algebra and Logic)

Constructive Models (Siberian School of Algebra and Logic)