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

Libro 74 de 138: Lecture Notes in Pure and Applied Mathematics

Sorbi, Andrea

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

Sinopsis

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

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
CRC Press
Año de publicación
2019
Idioma
Inglés
ISBN 10 
1138404101
ISBN 13 
9781138404106
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
380
Contacto del fabricante
Taylor and Francis, GPSR Taylor and Francis
gpsr@taylorandfrancis.com

Taylor & Francis Verlag GmbH, Kaufingerstraße 24
München
80331
Alemania

Otras ediciones populares con el mismo título

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

Edición Destacada

ISBN 10:  0824700260 ISBN 13:  9780824700263
Editorial: CRC Press, 1997
Tapa blanda