Proofs and algorithms : an introduction to logic and computability / Gilles Dowek.
Material type:
TextSeries: Undergraduate topics in computer sciencePublication details: London ; New York : Springer, 2011.Description: xii, 155 p. : ill. ; 24 cmISBN: - 9780857291202
- 0857291203
- 004.015113 22
- QA9 .D68 2011
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
African Association of Public Administration & Management (AAPAM) General stacks | QA9 .D69 2011 (Browse shelf(Opens below)) | Available | BK002881 | ||
Books
|
African Association of Public Administration & Management (AAPAM) General stacks | QA9 .D69 2011 (Browse shelf(Opens below)) | Available | BK002972 | ||
Books
|
African Association of Public Administration & Management (AAPAM) | QA9 .D68 2011 (Browse shelf(Opens below)) | Available | BK002884 |
Browsing African Association of Public Administration & Management (AAPAM) shelves Close shelf browser (Hides shelf browser)
| No cover image available No cover image available |
|
|
|
|
|
|
||
| QA 76.9538 .W48 2007 System Analysis and Design Methods | QA79.9.D35.L57 1986 Data structures | QA79.9.D35.L57 1986 Data structures | QA9 .D68 2011 Proofs and algorithms : an introduction to logic and computability / | QA9 .D69 2011 Proofs and algorithms : an introduction to logic and computability / | QA9 .D69 2011 Proofs and algorithms : an introduction to logic and computability / | QA 11.2 .E39 [2003?] Reading & Writing : In the Mathematics Classroom./ |
Includes bibliographical references (p. 151) and index.
Part. 1. Proofs: -- 1. Predicate logic. --Inductive definitions -- Languages -- The languages of predicate logic -- Proofs -- Examples of theories -- Variations on the principle of the excluded middle -- 2. Models. -- The notion of a model -- The Soundness Theorem -- The Completeness Theorem -- Other applications of the notion of model -- Part 2. Algorithms: -- 3. Computable functions. -- Computability over lists and trees -- Eliminating recursion -- Programs -- 4. Computation as a sequence of small steps. -- Rewriting -- The Lambda-Calculus -- Turing Machines -- Part 3. Proofs and algorithms: -- 5. Church's Theorem. -- The notion of reduction -- Representing programs -- Church's Theorem -- Semi-decidabilty -- Gödel's First Incompleteness Theorem -- 6. Automated theorem proving. -- Sequent Calculus -- Proof search in the sequent Calculus without cuts -- 7. Decidable theories -- 8. Constructivity -- 9. Epilogue.
There are no comments on this title.