| Document Type
|
:
|
BL
|
| Record Number
|
:
|
855383
|
| Main Entry
|
:
|
Prudhomme, Gerard.
|
| Title & Author
|
:
|
Computer Mathematics
|
| Publication Statement
|
:
|
Ashland :: Arcler Press,, 2019.
|
| Page. NO
|
:
|
1 online resource (268 pages)
|
| ISBN
|
:
|
1773615971
|
|
|
:
|
: 9781773615974
|
| 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; 2.1. Intensive Preliminary Courses of Logic; 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; 6.1. Calculability And Incompleteness; Chapter 7 Working Group on Core Courses; 7.1. Verifications; 7.2. Complexity; Chapter 8 Finite Model Theory
|
|
|
:
|
Chapter 23 Semantics of Programming LanguagesChapter 24 Stable Groups; Chapter 25 General Theory of Algorithms; Chapter 26 Recursive Functions; 26.1. Machine-Calculable 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 LogicChapter 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
|
|
|
:
|
Chapter 9 Calculability and IncompletenessChapter 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; 21.1. Basic Set Theory; Chapter 22 Descriptive Set Theory; 22.1. Structures And Techniques
|