Recursion-Theoretic Hierarchies by Peter G Hinman
Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. The theory set out in this volume, the ninth publication in the Perspectives in Logic series, is the result of the meeting and common development of two currents of mathematical research: descriptive set theory and recursion theory. Both are concerned with notions of definability and with the classification of mathematical objects according to their complexity. These are the common themes which run through the topics discussed here. The author develops a general theory from which the results of both areas can be derived, making these common threads clear.-
Computable Structure Theory
-
Subsystems of Second Order Arithmetic
-
General Recursion Theory
-
Computability in Analysis and Physics
-
Degrees of Unsolvability
-
Fundamentals of Stability Theory
-
Constructibility
-
Higher Recursion Theory
-
Essential Stability Theory
-
Model-Theoretic Logics
-
Admissible Sets and Structures
-
Pure Inductive Logic
-
Lambda Calculus with Types
-
Proofs and Computations
Peter G. Hinman works in the Department of Mathematics at the University of Michigan, Ann Arbor.
| SKU | Unavailable |
| ISBN 13 | 9781107168244 |
| ISBN 10 | 1107168244 |
| Title | Recursion-Theoretic Hierarchies |
| Author | Peter G Hinman |
| Series | Perspectives In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2017-03-02 |
| Number of pages | 492 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |