Cargando…
Recursive functionals /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York :
North-Holland,
1992.
|
| Colección: | Studies in logic and the foundations of mathematics ;
v. 131. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn316566833 | ||
| 003 | OCoLC | ||
| 005 | 20231117015242.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 090320s1992 ne a ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d OCLCF |d OCLCO |d DEBBG |d N$T |d IDEBK |d E7B |d UA@ |d YDXCP |d OCLCQ |d DEBSZ |d OCLCQ |d LEAUB |d VLY |d S2H |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 307588991 |a 646774968 |a 742292764 |a 815689851 |a 823117553 |a 823838619 |a 823906927 |a 824096387 |a 824149056 |a 1162193393 | ||
| 020 | |a 9780444894472 | ||
| 020 | |a 0444894470 | ||
| 020 | |a 9780080887173 |q (electronic bk.) | ||
| 020 | |a 0080887171 |q (electronic bk.) | ||
| 020 | |a 1281778834 | ||
| 020 | |a 9781281778833 | ||
| 020 | |a 9786611778835 | ||
| 020 | |a 6611778837 | ||
| 035 | |a (OCoLC)316566833 |z (OCoLC)307588991 |z (OCoLC)646774968 |z (OCoLC)742292764 |z (OCoLC)815689851 |z (OCoLC)823117553 |z (OCoLC)823838619 |z (OCoLC)823906927 |z (OCoLC)824096387 |z (OCoLC)824149056 |z (OCoLC)1162193393 | ||
| 050 | 4 | |a QA9.615 |b .S26 1992eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 072 | 7 | |a PBC |2 bicssc | |
| 082 | 0 | 4 | |a 511.3/5 |2 22 |
| 100 | 1 | |a Sanchis, Luis E. | |
| 245 | 1 | 0 | |a Recursive functionals / |c Luis E. Sanchis. |
| 260 | |a Amsterdam ; |a New York : |b North-Holland, |c 1992. | ||
| 300 | |a 1 online resource (xii, 277 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a Studies in logic and the foundations of mathematics ; |v v. 131 | |
| 520 | |a 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. | ||
| 504 | |a Includes bibliographical references (pages 265-267) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Front Cover; Recursive Functionals; Copyright Page; Contents; Preface; Chapter 1. Mappings and Domains; Chapter 2. Functionals and Predicates; Chapter 3. Basic Operations; Chapter 4. Primitive Recursive Operations; Chapter 5. Basic Recursion; Chapter 6. Church's Thesis; Chapter 7. Functional Recursion; Chapter 8. Recursive Algorithms; Chapter 9. Formalization: Structural Semantics; Chapter 10. Formalization: Reductional Semantics; Chapter 11. Interpreters; Chapter 12. A Universal Interpreter; Chapter 13. Enumeration; Chapter 14. Continuous Functionals; Chapter 15. A Selector Theorem | |
| 505 | 8 | |a Chapter 16. HyperenumerationChapter 17. Recursion in Normal Classes; Appendix Recursion and Church's Thesis; References; Index; List of Symbols | |
| 546 | |a English. | ||
| 650 | 0 | |a Recursive functions. | |
| 650 | 6 | |a Fonctions r�ecursives. |0 (CaQQLa)201-0024594 | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a Recursive functions |2 fast |0 (OCoLC)fst01091984 | |
| 650 | 7 | |a Fonctions r�ecursives. |2 ram | |
| 653 | 0 | |a Mathematical logic | |
| 776 | 0 | 8 | |i Print version: |a Sanchis, Luis E. |t Recursive functionals. |d Amsterdam ; New York : North-Holland, 1992 |z 0444894470 |z 9780444894472 |w (DLC) 92010555 |w (OCoLC)25628698 |
| 830 | 0 | |a Studies in logic and the foundations of mathematics ; |v v. 131. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444894472 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=0049237X&volume=131 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/0049237X/131 |z Texto completo |