论文信息 - Propositional Proof Systems

Propositional Proof Systems

We present a formalization of Sequent Calculus, Natural Deduction, Hilbert Calculus, and Resolution using a deep embedding of propositional formulas. We provide proofs of many of the classical results, including Cut Elimination, Craig’s Interpolation, proof transformation between all calculi, and soundness and completeness. Additionally, we formalize the Model Existence Theorem.

Tobias Nipkow | Julius Michaelis

[1] John Harrison,et al. Handbook of Practical Logic and Automated Reasoning , 2009 .

[2] W. V. Quine,et al. Der Minimalkalkul, ein Reduzierter Intutionistischer Formalismus. , 1937 .

[3] R M Smullyan,et al. A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[4] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[5] G. Gentzen. Untersuchungen über das logische Schließen. I , 1935 .

[6] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[7] William Craig,et al. Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.

[8] D. Hilbert. Die grundlagen der mathematik , 1928 .

[9] Valentin Goranko,et al. Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[10] Uwe Schöning. Logik für Informatiker , 1987, Reihe Informatik.