2000 character limit reached
Propositional Calculus in Coq (1503.08744v2)
Published 30 Mar 2015 in math.LO and cs.LO
Abstract: I formalize important theorems about classical propositional logic in the proof assistant Coq. The main theorems I prove are (1) the soundness and completeness of natural deduction calculus, (2) the equivalence between natural deduction calculus, Hilbert systems and sequent calculus and (3) cut elimination for sequent calculus.