Cambridge Higher Recursion Theory 2 - Perspectives in Logic - Image 1

£95.81

Cambridge University Press Cambridge Higher Recursion Theory 2 - Perspectives in Logic

Name: Cambridge Higher Recursion Theory 2 - Perspectives in Logic
Brand: Cambridge University Press
Price: 95.81 GBP
Availability: InStock

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£96 today · usual range £75–£116 · best ever £75

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 35 days • 35 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 35 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £75 (21 days, 60.0%)

Price range: £75 - £116

Price levels: 3 different prices over 35 days

Description

Expand your understanding of mathematical logic with Higher Recursion Theory: 2, published by Cambridge University Press. This volume serves as the second publication in the prestigious Perspectives in Logic series, bringing back a seminal work that was previously unavailable for many years. Designed as an almost self-contained introduction, this text is built for readers who already possess a foundation in the basics of classical recursion theory. It provides a clear pathway into advanced logical concepts, making it a necessary resource for students and researchers in the field. The content is organized into four distinct parts to guide your study: hyperarithmetic sets, metarecursion, alpha-recursion, and E-recursion. Whether you are returning to this classic text or discovering it for the first time, this book offers the depth and structure required to master higher recursion theory.

Key Features

Part of the Perspectives in Logic series, featuring seminal works by leading logicians in the field of mathematics and computer science.

Provides an almost self-contained introduction to higher recursion theory for those with basic knowledge of classical recursion theory.

Structured into four comprehensive parts covering hyperarithmetic sets, metarecursion, alpha-recursion, and E-recursion.

A returning classic from Cambridge University Press that has been brought back into print after being unavailable for years.

Essential reading for researchers and students looking for deep academic insights into advanced logical structures.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 1107168430
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 02 March 2017
Listed Since: 24 August 2016

Barcode

No barcode data available

Cambridge University Press Cambridge Higher Recursion Theory 2 - Perspectives in Logic

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

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

Recursion Theory: Lecture Notes in Logic 1 (Aatdf Monographs)

Recursion Theory: Lecture Notes in Logic 1

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

Thinking Recursively

Mathematical Logic and Theoretical Computer Science: 106 (Lecture Notes in Pure and Applied Mathematics)

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

Computability: An Introduction to Recursive Function Theory

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

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

Language and Recursion

Recursion and Human Language: 104 (Studies in Generative Grammar [SGG], 104)

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

Models of Peano Arithmetic: 15 (Oxford Logic Guides)

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

CRC Press - Mathematical Logic and Theoretical Computer Science

Computability Theory: An Introduction to Recursion Theory

Computability and Logic

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Forcing, Iterated Ultrapowers, And Turing Degrees: 29 (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore)

Introduction to Metamathematics (Bibliotheca Mathematica)

Constructive Models (Siberian School of Algebra and Logic)

Theory of Formal Systems. (AM-47), Volume 47 (Annals of Mathematics Studies)