Isabelle/HOL: A Proof Assistant for Higher-Order Logic
by T. Nipkow, L.C. Paulson, M. Wenzel
Publisher: Springer 2010
ISBN/ASIN: 3540433767
ISBN-13: 9783540433767
Number of pages: 223
Description:
This book is a self-contained introduction to interactive proof in higher-order logic (HOL), using the proof assistant Isabelle. It is a tutorial for potential users rather than a monograph for researchers. The book has three parts: Elementary Techniques; Logic and Sets; Advanced Material.
Download or read it online for free here:
Download link
(1.2MB, PDF)
Similar books
Computer Algebra, Algorithms, Systems and Applications
by Richard Liska, at al. - Czech Technical University
From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.
(17957 views)
by Richard Liska, at al. - Czech Technical University
From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.
(17957 views)
Strange Attractors: Creating Patterns in Chaos
by Julien C. Sprott - M & T Books
Chaos and fractals have revolutionized our view of the world. This book shows examples of the artistic beauty that can arise from very simple equations, and teaches the reader how to produce an endless variety of such patterns.
(21183 views)
by Julien C. Sprott - M & T Books
Chaos and fractals have revolutionized our view of the world. This book shows examples of the artistic beauty that can arise from very simple equations, and teaches the reader how to produce an endless variety of such patterns.
(21183 views)
Mathematics for Algorithm and Systems Analysis
by Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(31434 views)
by Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(31434 views)
A Computational Introduction to Number Theory and Algebra
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
(41914 views)
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
(41914 views)