Recursion Theory: Computational Aspects of Definability

Recursion Theory: Computational Aspects of Definability

2015 • 320 pages

The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.

Become a Librarian

Tags


Reviews

Popular Reviews

Reviews with the most likes.

There are no reviews for this book. Add yours and it'll show up right here!