General Recursion Theory
An Axiomatic Approach
£110.99
Part of Perspectives in Logic
- Author: Jens E. Fenstad, Universitetet i Oslo
- Date Published: March 2017
- availability: Available
- format: Hardback
- isbn: 9781107168169
£
110.99
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- A unified and coherent account of the many parts of general recursion theory
- Shows how computation theories connect with and unify other parts of general recursion theory
- Ideal for a second course in recursion theory
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2017
- format: Hardback
- isbn: 9781107168169
- length: 237 pages
- dimensions: 240 x 163 x 19 mm
- weight: 0.53kg
- contains: 1 b/w illus.
- availability: Available
Table of Contents
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.
Related Books
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×