Recursive Functionals

Kobo ebook | May 1, 1992

bySanchis, L.E.

not yet rated|write a review
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.

Pricing and Purchase Info

$73.79 online
$95.73 list price (save 22%)
Available for download
Not available in stores

From the Publisher

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, ...

Format:Kobo ebookPublished:May 1, 1992Publisher:North HollandLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0080887171

ISBN - 13:9780080887173

Look for similar items by category:

Customer Reviews of Recursive Functionals

Reviews