Häftad, Engelska, 1997
Del i serien Lecture Notes in Pure and Applied Mathematics
Complexity, Logic, and Recursion Theory
Av Andrea Sorbi
3729 kr
Tillfälligt slut
Beskrivning
"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."
Produktinformation
- Utgivningsdatum: 1997-02-04
- Mått: 210 x 280 x undefined mm
- Vikt: 635 g
- Format: Häftad
- Språk: Engelska
- Serie: Lecture Notes in Pure and Applied Mathematics
- Antal sidor: 384
- Förlag: Taylor & Francis Inc
- ISBN: 9780824700263
Utforska kategorier
Mer information
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.
Butikslager
Ej i lager i butik.
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.