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

Price loading...

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

bibliography, indices

Information Systems

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

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)

Price History & Forecast

No Price Data Available

Price Distribution

Description

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)

Computability Theory: An Introduction to Recursion Theory

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

The Foundations of Computability Theory

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Theory of Computation

Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)

Computability: An Introduction to Recursive Function Theory

Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III": 23 (Trends in Logic, 23)

Cambridge Higher Recursion Theory 2 - Perspectives in Logic

Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results

Computational Complexity: A Conceptual Perspective

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

Computability

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

Computable Structures and the Hyperarithmetical Hierarchy (Volume 144) (Studies in Logic and the Foundations of Mathematics, Volume 144)

Theory of Computation: Automata, Formal Languages, Computation and Complexity

Constructivism in Mathematics, Vol 2 (Volume 123) (Studies in Logic and the Foundations of Mathematics, Volume 123)

Proof And Computation II: From Proof Theory And Univalent Mathematics To Program Extraction And Verification

Recursion Theory: Lecture Notes in Logic 1

CRC Press - Introduction to Recursive Programming Book

Introduction to Recursive Programming

Springer Computational Invariant Theory: 130 Mathematics Book