Complexity, Logic, and Recursion Theory

Discover the fascinating intersection of logic, computability theory, and theoretical computer science in Complexity, Logic, and Recursion Theory by Andrea Sorbi. Published by Taylor & Francis Ltd in 2019, this insightful hardback edition spans 380 pages, offering a comprehensive exploration of contemporary research in these dynamic fields. Sorbi expertly integrates two distinct approaches to computability, making this book an essential resource for students, researchers, and professionals alike. Whether you are looking to deepen your understanding or stay updated on the latest advancements, this book serves as a valuable addition to your library. Dive into the complexities of logic and recursion theory and expand your knowledge today!