zbMATH — the first resource for mathematics

Applied logic for computer scientists. Computational deduction and formal proofs. (English) Zbl 1401.03001
Undergraduate Topics in Computer Science. Cham: Springer (ISBN 978-3-319-51651-6/pbk; 978-3-319-51653-0/ebook). xviii, 150 p. (2017).
Publisher’s description: This book provides an introduction to logic and mathematical induction which are the basis of any deductive computational framework. A strong mathematical foundation of the logical engines available in modern proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians and engineers to increment their capabilities to provide formal proofs of theorems and to certify the robustness of software and hardware systems.
The authors present a concise overview of the necessary computational and mathematical aspects of ‘logic’, placing emphasis on both natural deduction and sequent calculus. Differences between constructive and classical logic are highlighted through several examples and exercises. Without neglecting classical aspects of computational logic, the authors also highlight the connections between logical deduction rules and proof commands in proof assistants, presenting simple examples of formalizations of the correctness of algebraic functions and algorithms in PVS.
Applied Logic for Computer Scientists will not only benefit students of computer science and mathematics but also software, hardware, automation, electrical and mechatronic engineers who are interested in the application of formal methods and the related computational tools to provide mathematical certificates of the quality and accuracy of their products and technologies.
MSC:
 03-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations 00A06 Mathematics for nonmathematicians (engineering, social sciences, etc.) 03B10 Classical first-order logic 03B35 Mechanization of proofs and logical operations 03F03 Proof theory, general (including proof-theoretic semantics)
PVS
Full Text: