A Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic. Soundness and completeness for a system of first order logic are formally proved, building on James Margetson’s formalization of work by Wainer and Wallen. The completeness proofs naturally suggest an algorithm to derive proofs. This algorithm, which can be implemented tail recursively, is formalized in Isabelle/HOL. The algorithm can be executed via the rewriting tactics of Isabelle. Alternatively, the definitions can be exported to OCaml, yielding a directly executable program.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Jensen, Alexander Birch; Larsen, John Bruntse; Schlichtkrull, Anders; Villadsen, Jørgen: Programming and verifying a declarative first-order prover in Isabelle/HOL (2018)
- Schlichtkrull, Anders: Formalization of the resolution calculus for first-order logic (2018)
- Klein, Gerwin: Operating system verification---an overview (2009)