The Leading eBooks Store Online
for your Apple or Android device, Nook, Kobo, PC, Mac, Sony Reader...
Recursive Functionals
Add to cart
US$ 129.50
(+ tax)
Preview (read now)
Add to my own site
Buy multiple copies
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPad
- PC
- e-readers with Adobe Digital Editions installed
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPad
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
This work is a self-contained elementary exposition of the theory of recursive functionals, that also includes a number of advanced results. Although aiming basically at a theory of higher order computability, attention is restricted to second order functionals, where the arguments are numerical functions and the values, when defined, are natural numbers. This theory is somewhat special, for to some extent it can be reduced to first order theory, but when properly extended and relativized it requires the full machinery of higher order computations. In the theory of recursive monotonic functionals the author formulates a reasonable notion of computation which provides the right frame for what appears to be a convincing form of the extended Church's thesis. At the same time, the theory provides sufficient room to formulate the classical results that are usually derived in terms of singular functionals. Presented are complete proofs of Gandy's selector theorem, Kleene's theorem on hyperarithmetical predicates, and Grilliot's theorem on effectively discontinuous functionals.
Subject categories
- Academic > Mathematics > General > Logic, Symbolic and mathematical
- Academic > Mathematics > General > Recursion theory
- Academic > Mathematics > General > Recursive functions
- Academic > Mathematics > Instruments and machines
- Academic > Mathematics > Analytic mechanics
- Academic > Logic > Recursion theory
- Academic > Logic > Recursive functions
- Academic > Computer Science
- Mathematics > Logic
ISBNs
9780444894472
9780080887173
0080887171