Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8 - Image 1

£89.99

De Gruyter Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8

Name: Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8
Brand: De Gruyter
Price: 89.99 GBP
Availability: InStock

Information Systems

It has never been this cheap. We have no record of a lower price.

£90 today · cheaper than every other day in the last 3 months

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 47 days · 47 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 47 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £135 (31 days, 66.0%)

Price range: £90 - £152

Price levels: 3 different prices over 47 days

Description

This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory.The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.

Product Specifications

Brand: De Gruyter
Format: hardcover
ASIN: 3110275554
Category: Books > Subjects > Computing & Internet > Computer Science > Information Systems
Domain: Amazon UK
Release Date: 30 July 2015
Listed Since: 04 October 2014

Barcode

No barcode data available

De Gruyter Recursion Theory: Computational Aspects of Definability (De Gruyter Series in Logic & its Applications): 8

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

The Determinacy of Long Games (De Gruyter Series in Logic & Its Applications): 7

Super-Recursive Algorithms (Monographs in Computer Science)

Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic): Series Number 48

Bounded Queries in Recursion Theory: 16 (Progress in Computer Science and Applied Logic, 16)

Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion (Progress in Theoretical Computer Science)

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)

Solving Higher-Order Equations: From Logic to Programming (Progress in Theoretical Computer Science)

The Foundations of Computability Theory

Theory of Reversible Computing (Monographs in Theoretical Computer Science. An EATCS Series)

Combinatorics and Finite Fields: Difference Sets, Polynomials, Pseudorandomness and Applications: 23 (Radon Series on Computational and Applied Mathematics, 23)

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Theories of Computability

Computability and Models: Perspectives East and West (University Series in Mathematics)

Logic of Domains (Progress in Theoretical Computer Science)

An Introduction to Formal Languages and Machine Computation

Recursion: Complexity in Cognition: 43 (Studies in Theoretical Psycholinguistics, 43)

Algebraic Approaches to Program Semantics (Monographs in Computer Science)

Power Algebras over Semirings: With Applications in Mathematics and Computer Science: 488 (Mathematics and Its Applications, 488)

Einführung in Die Determinantentheorie Einschließlich Der Unendlichen Und Der Fredholmschen Determinanten

A Model–Theoretic Approach to Proof Theory: 51 (Trends in Logic, 51)

Discrepancy Theory: 26 (Radon Series on Computational and Applied Mathematics, 26)

Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)

Bernstein Functions: Theory and Applications (De Gruyter Studies in Mathematics, 37)

Combinatorial Machine Learning: A Rough Set Approach: 360 (Studies in Computational Intelligence, 360)