Applied Logic for Computer Scientists and Mathematicians

Beschreibung

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 interactive proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians, and engineers to enhance 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 as well as mechanizations of proofs of mathematical theorems.

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 interactive proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians, and engineers to enhance 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 as well as mechanizations of proofs of mathematical theorems.

Autor*in

Mauricio Ayala-Rincón

Themen in »Applied Logic for Computer Scientists and Mathematicians«

First-Order Logic Natural Deduction Predicate and Propositional Logic Deductive Computational Framework Sequent Calculus Algebraic Functions

Stimmen zu »Applied Logic for Computer Scientists and Mathematicians«

Details

Link teilen