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