Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Abstract. This paper reports on the Mizar formalization of the theory of continuous lattices as presented in A Compendium of Continuous Lattices, [25]. By the Mizar formalization w...