Tell your friends about this item:
Complexity, Logic, and Recursion Theory - Lecture Notes in Pure and Applied Mathematics Andrea Sorbi 1st edition
Complexity, Logic, and Recursion Theory - Lecture Notes in Pure and Applied Mathematics
Andrea Sorbi
Presents coverage of research at the interface of logic, computability theory, and theoretical computer science. This book integrates two approaches to computability.
380 pages
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | June 7, 2019 |
| ISBN13 | 9781138404106 |
| Publishers | Taylor & Francis Ltd |
| Pages | 380 |
| Dimensions | 184 × 263 × 27 mm · 842 g |
| Language | English |
| Series Editor | Nashed, Zuhair (University of Central Florida, Orlando, USA) |
| Series Editor | Taft, Earl |