Recursive Functionals - 1st Edition - ISBN: 9780444894472, 9780080887173

Recursive Functionals, Volume 131

1st Edition

Authors: L.E. Sanchis
eBook ISBN: 9780080887173
Imprint: North Holland
Published Date: 18th May 1992
Page Count: 276
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
72.95
51.06
51.06
51.06
51.06
51.06
58.36
58.36
43.99
30.79
30.79
30.79
30.79
30.79
35.19
35.19
54.95
38.47
38.47
38.47
38.47
38.47
43.96
43.96
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

Mappings and Domains. Functionals and Predicates. Basic Operations. Primitive Recursive Operations. Basic Recursion. Church's Thesis. Functional Recursion. Recursive Algorithms. Formalization: Structural Semantics. Formalization: Reductional Semantics. Interpreters. A Universal Interpreter. Enumeration. Continuous Functionals. A Selector Theorem. Hyperenumeration. Recursion in Normal Classes. Recursion and Church's Thesis. References. Index.


Description

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.


Details

No. of pages:
276
Language:
English
Copyright:
© North Holland 1992
Published:
Imprint:
North Holland
eBook ISBN:
9780080887173

About the Authors

L.E. Sanchis Author

Affiliations and Expertise

School of Computer and Information Science, Syracuse University, Syracuse, NY, USA