Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics) - Hardcover

Sorbi, Andrea

 
9781138404106: Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)
Hardcover
ISBN 10: 1138404101 ISBN 13: 9781138404106
Publisher: CRC Press, 2019

Synopsis

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

"synopsis" may belong to another edition of this title.

About the Author

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.

"About this title" may belong to another edition of this title.

Publisher
CRC Press
Publication date
2019
Language
English
ISBN 10 
1138404101
ISBN 13 
9781138404106
Binding
Hardcover
Edition number
1
Number of pages
380

Other Popular Editions of the Same Title

9780824700263: Complexity, Logic, and Recursion Theory: 187 (Lecture Notes in Pure and Applied Mathematics)

Featured Edition

ISBN 10:  0824700260 ISBN 13:  9780824700263
Publisher: CRC Press, 1997
Softcover