Complexity, Logic, and Recursion Theory

Inbunden, Engelska, 2019

3 159 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

"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."

Produktinformation

Utgivningsdatum2019-06-07
Mått178 x 254 x 27 mm
Vikt860 g
FormatInbunden
SpråkEngelska
SerieLecture Notes in Pure and Applied Mathematics
Antal sidor380
FörlagTaylor & Francis Ltd
ISBN9781138404106

Tillhör följande kategorier

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.

Preface, Contributors, Resource-Bounded Measure and Randomness, Degree Structures in Local Degree Theory, Compressibility of Infinite Binary Sequences, Beyond Gödel’s Theorem: The Failure to Capture Information Content, Progressions of Theories of Bounded Arithmetic, On Presentations of Algebraic Structures, Witness-Isomorphic Reductions and Local Search, A Survey of Inductive Inference with an Emphasis on Queries, A Uniformity of Degree Structures, Short Course on Logic, Algebra, and Topology, The Enumeration Degrees of the ∑02 Sets, The Convenience of Tilings