Propositional Calculus in Coq
Logic
2015-04-01 v2 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1503.08744,
title = {Propositional Calculus in Coq},
author = {Floris van Doorn},
journal= {arXiv preprint arXiv:1503.08744},
year = {2015}
}
Comments
11 pages, project for 2014 Proof Theory class at CMU. Added ancillary files (Coq source files) in this version