Computational Logic and Set Theory
Applying Formalized Logic to Analysis
Nonfiction, Computers, Advanced Computing, Theory, Computer Science, General Computing
| Author: | Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo | ISBN: | 9780857298089 |
| Publisher: | Springer London | Publication: | July 16, 2011 |
| Imprint: | Springer | Language: | English |
| Author: | Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo |
| ISBN: | 9780857298089 |
| Publisher: | Springer London |
| Publication: | July 16, 2011 |
| Imprint: | Springer |
| Language: | English |
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma.
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Topics and features: describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics; presents an unique system for automated proof verification in large-scale software systems; integrates important proof-engineering issues, reflecting the goals of large-scale verifiers; includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma.
