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

Price loading...

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

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

Architecture & Microprocessors

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

"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."

Product Specifications

Brand: CRC Press
Format: Paperback
ASIN: 0824700260
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 04 February 1997
Listed Since: 10 February 2007

Barcode

No barcode data available

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

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

Recursion Theory: Lecture Notes in Logic 1

Computability Theory: An Introduction to Recursion Theory

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

CRC Press - Mathematical Logic and Theoretical Computer Science

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

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

Concise Introduction to Logic and Set Theory (Mathematics and its Applications)

Combinatory Logic: Pure, Applied and Typed (Discrete Mathematics and Its Applications)

Paraconsistency: The Logical Way to the Inconsistent (Lecture Notes in Pure and Applied Mathematics)

Fundamentals of Mathematical Logic

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Computability

Theory of Computation (Texts in Computer Science)

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

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

Proof Complexity: 170 (Encyclopedia of Mathematics and its Applications, Series Number 170)

Classical and Fuzzy Concepts in Mathematical Logic and Applications, Professional Version

Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction (Springer Monographs in Mathematics)

Computers in Mathematics (Lecture Notes in Pure and Applied Mathematics)

Computability: An Introduction to Recursive Function Theory

Computational Complexity: A Conceptual Perspective

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

Introduction to Mathematical Logic (Discrete Mathematics and Its Applications)