Computable Structure Theory by Antonio Montalbán
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.-
Subsystems of Second Order Arithmetic
-
General Recursion Theory
-
Computability in Analysis and Physics
-
Recursion-Theoretic Hierarchies
-
Degrees of Unsolvability
-
Fundamentals of Stability Theory
-
Constructibility
-
Higher Recursion Theory
-
Essential Stability Theory
-
Model-Theoretic Logics
-
Proper and Improper Forcing
-
Admissible Sets and Structures
-
Pure Inductive Logic
-
Lambda Calculus with Types
-
Proofs and Computations
Antonio Montalbán is Professor of Mathematics at the University of California, Berkeley.
| SKU | Unavailable |
| ISBN 13 | 9781108490252 |
| ISBN 10 | 1108490255 |
| Title | Computable Structure Theory |
| Author | Antonio Montalbán |
| Series | Perspectives In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2026-02-28 |
| Number of pages | 246 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |