
Complexity, Logic, and Recursion Theory
Andrea Sorbi(Author)
CRC Press
1st Edition
Published on 7. June 2019
Book
Hardback
380 pages
978-1-138-40410-6 (ISBN)
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."
More details
Series
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Professional
Dimensions
Height: 260 mm
Width: 183 mm
Thickness: 25 mm
Weight
908 gr
ISBN-13
978-1-138-40410-6 (9781138404106)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Andrea Sorbi
Complexity, Logic, and Recursion Theory
E-Book
05/2019
CRC Press
€350.99
Available for download

Andrea Sorbi
Complexity, Logic, and Recursion Theory
E-Book
05/2019
1st Edition
CRC Press
€350.99
Available for download

Andrea Sorbi
Complexity, Logic, and Recursion Theory
Book
02/1997
1st Edition
CRC Press
€328.07
Article not available at the moment
Person
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.
Content
Preface, Contributors, Resource-Bounded Measure and Randomness, Degree Structures in Local Degree Theory, Compressibility of Infinite Binary Sequences, Beyond Goedel'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