General Recursion Theory
An Axiomatic Approach
Seiten
2017
Cambridge University Press (Verlag)
978-1-107-16816-9 (ISBN)
Cambridge University Press (Verlag)
978-1-107-16816-9 (ISBN)
This volume presents a unified and coherent account of general recursion theory. The main core of the book gives an account of the general theory of computations, then the author moves on to show how computation theories connect and unify other parts of recursion theory.
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.
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.
Jens E. Fenstad works in the Department of Mathematics at the University of Oslo.
Pons Asinorum; On the choice of correct notations for general theory; Part I. General Theory: 1. General theory: combinatorial part; 2. General theory: subcomputations; Part II. Finite Theories: 3. Finite theories on one type; 4. Finite theories on two types; Part III. Infinite Theories: 5. Admissible prewellorderings; 6. Degree structure; Part IV. Higher Types: 7. Computations over two types; 8. Set recursion and higher types; References; Notation; Author index; Subject index.
| Erscheinungsdatum | 28.02.2017 |
|---|---|
| Reihe/Serie | Perspectives in Logic |
| Zusatzinfo | 1 Line drawings, black and white |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 163 x 240 mm |
| Gewicht | 530 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre |
| ISBN-10 | 1-107-16816-3 / 1107168163 |
| ISBN-13 | 978-1-107-16816-9 / 9781107168169 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
World Scientific Publishing Co Pte Ltd (Verlag)
CHF 43,60
what we have that machines don't
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
how simple questions lead us to mathematics’ deepest truths
Buch | Softcover (2024)
Profile Books Ltd (Verlag)
CHF 19,15
