Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

Source URL: user.it.uu.se

• Proof assistants
• Theoretical computer science
• Logic in computer science
• Mathematical logic
• Isabelle
• Logic for Computable Functions
• Mathematics
• Resolution
• Constructible universe
• Theorem prover
• LCF
• Formal methods

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: isabelle.in.tum.de

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

An Explicating Theorem Prover for Quantified Formulas

Source URL: rjoshi.org

• Logic
• Mathematical logic
• Mathematics
• Model theory
• Semantics
• Predicate logic
• Formal languages
• Boolean satisfiability problem
• Tautology
• Well-formed formula
• Conjunctive normal form
• Interpretation

Testing a Saturation-Based Theorem Prover: Experiences and Challenges Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,2 1 School of Computer Science, University of Manchester, UK

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Formal methods
• Mathematical logic
• School of Computer Science
• University of Manchester
• Mathematics
• Logic in computer science
• Automated theorem proving
• Formal verification
• SPASS
• Andrei Voronkov
• Vampire
• First-order logic

Testing a Saturation-Based Theorem Prover: Experiences and Challenges? Giles Reger1 , Martin Suda2 , and Andrei Voronkov1,3,4 1 3

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Formal methods
• Mathematics
• Logic in computer science
• Mathematical logic
• Automated theorem proving
• School of Computer Science
• University of Manchester
• Automated reasoning
• Formal verification
• E theorem prover
• IP
• Satisfiability modulo theories

Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover Tjark Weber

Source URL: user.it.uu.se

• Theoretical computer science
• NP-complete problems
• Formal methods
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Isabelle
• Constructible universe
• LCF
• Mathematics
• (SAT
• -UNSAT)

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: mirror.clarkson.edu

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: www.cl.cam.ac.uk

• Mathematics
• Order theory
• Algebra
• Abstract algebra
• Lattice theory
• Mathematical logic
• Algebraic structures
• Predicate logic
• Distributive lattice
• Complete Heyting algebra
• Mereology
• Partially ordered set

A Verified Lisp Implementation for A Verified Theorem Prover Scheme workshop 2016, Nara, Japan Magnus O. Myreen — University of Cambridge, but now at Chalmers University of Technology Jared Davis — Centaur Technology

Source URL: scheme2016.snow-fort.org

UNIVERSITY OF CALIFORNIA, SAN DIEGO Liquid Haskell: Haskell as a Theorem Prover A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy

Source URL: goto.ucsd.edu