134,99 €
inkl. MwSt.
Versandkostenfrei*
Erscheint vorauss. 31. Januar 2026
Melden Sie sich für den Produktalarm an, um über die Verfügbarkeit des Produkts informiert zu werden.

payback
67 °P sammeln
  • Gebundenes Buch

Computable structure theory quantifies and studies the relative complexity of mathematical structures. This text, in conjunction with the author's previous volume, represents the first full monograph on computable structure theory in two decades. It brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework. Geared towards graduate students and researchers in mathematical logic, the book enables the reader to learn all the main results and techniques in the area for application in their…mehr

Produktbeschreibung
Computable structure theory quantifies and studies the relative complexity of mathematical structures. This text, in conjunction with the author's previous volume, represents the first full monograph on computable structure theory in two decades. It brings new results of the author together with many older results that were previously scattered across the literature and presents them all in a coherent framework. Geared towards graduate students and researchers in mathematical logic, the book enables the reader to learn all the main results and techniques in the area for application in their own research. While the previous volume focused on countable structures whose complexity can be measured within arithmetic, this second volume delves into structures beyond arithmetic, moving into the realm of the hyperarithmetic and the infinitary languages.
Autorenporträt
Antonio Montalbán is Professor of Mathematics at the University of California, Berkeley.