Cantitate/Preț
Produs

Applied Logic for Computer Scientists: Computational Deduction and Formal Proofs: Undergraduate Topics in Computer Science

Autor Mauricio Ayala-Rincón, Flávio L. C. de Moura
en Limba Engleză Paperback – 13 feb 2017
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. 
Citește tot Restrânge

Din seria Undergraduate Topics in Computer Science

Preț: 29766 lei

Preț vechi: 37208 lei
-20% Nou

Puncte Express: 446

Preț estimativ în valută:
5698 5946$ 4777£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319516516
ISBN-10: 3319516515
Pagini: 150
Ilustrații: XVIII, 150 p. 4 illus.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:1st ed. 2017
Editura: Springer International Publishing
Colecția Springer
Seria Undergraduate Topics in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Foreword. - Preface.- Introduction.- Derivation and Proofs in the Propositional Logic.- Derivations and Proofs in the Predicate Logic.- Deductions in the Style of Gentzen's Sequent Calculus.- Derivations and Formalizations.- Algebraic and Computational Examples.- Suggested Readings.- Index.

Notă biografică

Mauricio Ayala-Rincón is a Professor in Theory of Computing at the  Universidade de Brasília. He received his doctorate in Informatics from the Universität Kaiserslautern.  His primarily research interests are in logic and semantics of computation. His publications are related with rewriting, lambda calculus and with the applications of these frameworks in theorem proving and automated reasoning.  
Flávio L. C. de Moura is an Adjunct Professor in Computer Science at the Universidade de Brasília where he received his Ph.D in Mathematics (Theory of Computing). He has done long term research programs at Heriot-Watt University and Université Paris Diderot. His research is focused on lambda calculus and explicit substitutions, and in the application of proof assistants for the formalization of computation and mathematics.

Textul de pe ultima copertă

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 algebraicfunctions 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. 

Caracteristici

Provides readers with the fundamental tools needed to develop mathematical certificates of correctness and robustness of software and hardware systems Explains how logical deductive rules are related with proof commands available in deductive frameworks such as PVS Clarifies the differences between constructive and classical deduction Includes supplementary material: sn.pub/extras