Computer Mathematics
eBook - PDF

Computer Mathematics

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

Computer Mathematics

About this book

Computer mathematics examines various aspects of mathematics including an extensiveoverview of computational mathematics. It includes definitions of predictable phenomena, theory of models and of groups, programming models, introduction to formalcomputer-aided proof, theory of the demonstration, working group on core courses, finite model theory, calculability and incompleteness, programming models, combinator, mathematical logic, foundations of computing, provides the reader with insightsinto the development of its history, so as to understand the general theory of algorithms, recursive functions, introduction to complexity, theory of finite models and applications, approximate verification and complexity, working on fundamental courses, preliminaryintensive logic.

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.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. 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 Computer Mathematics by Gerard Prudhomme in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematics General. We have over one million books available in our catalogue for you to explore.

Information

Table of contents

  1. Cover
  2. Half Title Page
  3. Title Page
  4. Copyright Page
  5. About the Author
  6. Table of Contents
  7. List of Figures
  8. Preface
  9. Chapter 1 Preparatory Mathematical and Computer Science Studies
  10. Chapter 2 Predictable Phenomena
  11. Chapter 3 Theory of Models and of Groups
  12. Chapter 4 Programming Models
  13. Chapter 5 Introduction to Formal Computer-Aided Proof
  14. Chapter 6 Theory of the Demonstration
  15. Chapter 7 Working Group on Core Courses
  16. Chapter 8 Finite Model Theory
  17. Chapter 9 Calculability and Incompleteness
  18. Chapter 10 Programming Models
  19. Chapter 11 Combinators
  20. Chapter 12 Mathematical Logic
  21. Chapter 13 Foundations of Computing
  22. Chapter 14 Formal Arithmetic
  23. Chapter 15 Database Object Component
  24. Chapter 16 Arithmetization of Logic
  25. Chapter 17 Computability and Complexity
  26. Chapter 18 Polarization and Classical Logic
  27. Chapter 19 Syntax and Semantics
  28. Chapter 20 Proofs and Types
  29. Chapter 21 Foundations for Programming Languages
  30. Chapter 22 Descriptive Set Theory
  31. Chapter 23 Semantics of Programming Languages
  32. Chapter 24 Stable Groups
  33. Chapter 25 General Theory of Algorithms
  34. Chapter 26 Recursive Functions
  35. Chapter 27 Logical Characterization of Computable Functions
  36. Chapter 28 Notions of Reduction and Undecidable Problems
  37. Chapter 29 Introduction to Complexity
  38. Chapter 30 Theory of Finite Models and Applications
  39. Chapter 31 Approximate Verification and Complexity
  40. Chapter 32 Working on Fundamental Courses
  41. Chapter 33 Preliminary Intensive Logic
  42. Chapter 34 Classic Tools
  43. Chapter 35 An Introduction to Contemporary Mathematical Logic
  44. Chapter 36 A Course in Model Theory
  45. Chapter 37 Classes and Completeness
  46. Chapter 38 Axioms
  47. Chapter 39 The Incompleteness Theorems
  48. Chapter 40 Conceptual Perspectives
  49. Chapter 41 Programming Perspectives
  50. Chapter 42 Advances in Linear Logic
  51. Chapter 43 Symbolic Logic
  52. Bibliography
  53. Index