Recursive Functionals
eBook - PDF

Recursive Functionals

  1. 276 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Recursive Functionals

About this book

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.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Recursive Functionals by L.E. Sanchis in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematical Analysis. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Front Cover
  2. Recursive Functionals
  3. Copyright Page
  4. Contents
  5. Preface
  6. Chapter 1. Mappings and Domains
  7. Chapter 2. Functionals and Predicates
  8. Chapter 3. Basic Operations
  9. Chapter 4. Primitive Recursive Operations
  10. Chapter 5. Basic Recursion
  11. Chapter 6. Church’s Thesis
  12. Chapter 7. Functional Recursion
  13. Chapter 8. Recursive Algorithms
  14. Chapter 9. Formalization: Structural Semantics
  15. Chapter 10. Formalization: Reductional Semantics
  16. Chapter 11. Interpreters
  17. Chapter 12. A Universal Interpreter
  18. Chapter 13. Enumeration
  19. Chapter 14. Continuous Functionals
  20. Chapter 15. A Selector Theorem
  21. Chapter 16. Hyperenumeration
  22. Chapter 17. Recursion in Normal Classes
  23. Appendix Recursion and Church’s Thesis
  24. References
  25. Index
  26. List of Symbols