General Recursion Theory by Jens E Fenstad
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. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.-
Computable Structure Theory
-
Subsystems of Second Order Arithmetic
-
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
-
Admissible Sets and Structures
-
Pure Inductive Logic
-
Lambda Calculus with Types
-
Proofs and Computations
Jens E. Fenstad works in the Department of Mathematics at the University of Oslo.
| SKU | Unavailable |
| ISBN 13 | 9781107168169 |
| ISBN 10 | 1107168163 |
| Title | General Recursion Theory |
| Author | Jens E Fenstad |
| Series | Perspectives In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2017-03-02 |
| Number of pages | 237 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |