๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Recursive functionals

โœ Scribed by L.E. Sanchis


Publisher
North-Holland
Year
1992
Tongue
English
Leaves
290
Series
Studies in logic and the foundations of mathematics 131
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Recursive Functionals
โœ L.E. Sanchis ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› North Holland ๐ŸŒ English

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 fun

Recursive Functionals
โœ Luis E. Sanchis ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Elsevier, Academic Press ๐ŸŒ English

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 fun

Recursive Functionals
โœ Luis E. Sanchis ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Elsevier, Academic Press ๐ŸŒ English

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 fun

Recursive Functionals
โœ L.E. Sanchis ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› North Holland ๐ŸŒ English

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 fun

Recursive functionals
โœ L.E. Sanchis ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› North-Holland ๐ŸŒ English

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 fun