Read more
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.
List of contents
Introduction.- Propositional and Predicate-Calculus Preliminaries.- A Survey of Inference Mechanisms.- More on the Structure of the Verifier System.- A Closer Examination of the Sequence of Definitions and Theorems Presented in this Book.- Undecidability and Unsolvability.
Report
From the book reviews:
"This is a text defining new formulae, theorems, lemmas, and sublanguages. Partition calculus and subset theory is well developed. ... I recommend this book to all students and logicians." (Joseph J. Grenier, Amazon.com, August, 2014)
"The contents of the book makes it inspiring and interesting both to mathematicians and to computer scientists. ... This is one of a few recent books which promise to both make mathematicians aware of the possibilities opened by the recent progress in automated theorem proving and draw the attention of the researchers working in logic and automated theorem proving to the challenges and possibilities raised by interesting problems in mathematics." (Viorica Sofronie-Stokkermans, Zentralblatt MATH, Vol. 1246, 2012)
