Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Applied Logic for Computer Scientists

Computational Deduction and Formal Proofs
BuchKartoniert, Paperback
150 Seiten
Englisch
Springererschienen am13.02.20171st ed. 2017
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.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR48,14
E-BookPDF1 - PDF WatermarkE-Book
EUR48,14

Produkt

KlappentextA 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.
Details
ISBN/GTIN978-3-319-51651-6
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2017
Erscheinungsdatum13.02.2017
Auflage1st ed. 2017
ReiheUndergraduate Topics in Computer Science
Seiten150 Seiten
SpracheEnglisch
Gewicht270 g
IllustrationenXVIII, 150 p. 4 illus.
Artikel-Nr.41613082

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Autor

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.
Weitere Artikel von
Ayala-Rincón, Mauricio
Weitere Artikel von
de Moura, Flávio L. C.