Propositional Proof Systems

Julius Michaelis and Tobias Nipkow

21 June 2017

Abstract

We formalize a range of proof systems for classical propositional logic (sequent calculus, natural deduction, Hilbert systems, resolution) and prove the most important meta-theoretic results about semantics and proofs: compactness, soundness, completeness, translations between proof systems, cut-elimination, interpolation and model existence.
BSD License

Used by

Topics

Theories

Cite

×
@article{Propositional_Proof_Systems-AFP,
  author  = {Julius Michaelis and Tobias Nipkow},
  title   = {Propositional Proof Systems},
  journal = {Archive of Formal Proofs},
  month   = June,
  year    = 2017,
  note    = {\url{http://isa-afp.org/entries/Propositional_Proof_Systems.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download