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

Applied Mathematics

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

Product 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." About the Author Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.

Product Specifications

Brand: CRC Press
Format: hardcover
ASIN: 1138404101
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Applied Mathematics
Domain: Amazon UK
Release Date: 17 June 2019
Listed Since: 06 June 2019

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)

Computability Theory: An Introduction to Recursion Theory

Recursion Theory: Lecture Notes in Logic 1

Logic and Complexity (Discrete Mathematics and Theoretical Computer Science)

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

CRC Press - Mathematical Logic and Theoretical Computer Science

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

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Computability

Logic and Algebra: 180 (Lecture Notes in Pure and Applied Mathematics)

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

The Foundations of Computability Theory

Models and Computability: Invited Papers from Logic Colloquium '97, European Meeting of the Association for Symbolic Logic, Leeds, July 1997: 259 ... Lecture Note Series, Series Number 259)

Proof Theory: Sequent Calculi and Related Formalisms (Discrete Mathematics and Its Applications)

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

The Incomputable: Journeys Beyond the Turing Barrier (Theory and Applications of Computability)

Computability and Complexity

Computation Engineering: Applied Automata Theory and Logic

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

Fundamentals of Mathematical Logic

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)

Arnon Avron on Semantics and Proof Theory of Non-Classical Logics: 21 (Outstanding Contributions to Logic, 21)

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)