Normal natural deduction proofs (in classical logic)

Studia Logica

Volumn 60, Issue 1, 1998, Pages 67-106

  Sleg, Wllfried ^a   Byrnes, John ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 54649084229     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/a:1005091418752     Document Type: Article

References (31)

1. ANDREWS, F., 'Transforming matings into natural deduction proofs', in 5th Conference on Automated Deduction, 281-292, New York, Berlin, Springer-Verlag, 1980.
2. BAAZ M., and C. G. FERMÜLLER, 'Non-elementary speedups between different versions of tableaux', in Baumgartner et al., editors, Theorem Proving with Analytic Tableaux and Related Methods, 217-230. Springer, 1995.
3. BLEDSOE, W., 'Non-resolution theorem proving', Artificial Intelligence 9, 1977, 1-35.
4. BLEDSOE, W., 'The UT natural-deduction prover', Technical Report, Departments of Mathematics and Computer Science, University of Texas, April 1983.
5. ClTTADINI, S., 'Intercalation calculus for mtuitionistic prepositional logic', Carnegie Mellon Technical Report PHIL-29, Philosophy, Methodology, and Logic, 1992.
6. CONSTABLE, R. et al, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, NJ, 1986.
7. FITCH, F. B., Symbolic Logic: An Introduction, Ronald, 1952.
8. FITTING, M., First-Order Logic and Automated Theorem Proving, Springer-Verlag, New York, Berlin, 1990.
9. GENTZEN, G., 'Untersuchungen über das logische Schlieβen i, ii', Math. Zeitschrift 39, 1934, 176-210, 1935, 405-431. English translation in [11J.
10. GENTZEN, G., 'Die Widerspruchsfreiheit der reinen Zahlentheorie', Mathematische Annalen 112, 1936, 493-565. English translation in [11].
11. GENTZEN, G., The Collected Papers of Gerhard Gentzen, North-Holland Publishing Company, Amsterdam, edited by M. E. Szabo, 1969.
12. HERBRAND, J., Logical Writings, Cambridge, Harvard University, edited by W. Goldfarb, 1971.
13. JASKOWSKI, S., 'On the rules of suppositions in formal logic' Studio Logica (1), 1934.
14. KLEENE, S. C., 1952, Introduction to Metamathematics, Wolters-Noordhoff Publishing, Groningen.
15. MACLANE, S., Abgekürzte Beweise im Logikkalkül, PhD thesis, University of Göttingen, 1934.
16. MACLANE, S., 'A logical analysis of mathematical structure', The Monist, 1935, 118130. The paper was read to the American Mathematical Society on December 28, 1933.
17. NEVINS, A. J., 'A human oriented logic for automatic theorem proving', J. ACM 21, 1974. 606-621.
18. PAULSON, L., Logic and Computation: Interactive Proof with Cambridge LCF, Cambridge University Piesb, 1987.
19. PELLETIER, J., 'Automated natural deduction in Thinker', this volume, 3-43.
20. [20l PFENNING, F., Proof Transformations in Higher-Order Logic, PhD thesis, Carnegie Mellon University, 1987.
21. POHTOHARD, F., 'Strategic construction of Fitch-style proofs', this volume, 45-66.
22. PRAWITZ, D., Natural Deduction: A Proof-Theoretical Study, Almqvist & Wiskell, Stockholm, 1965.
23. SHANIN, N. A. et al., 'An algorithm for a machine search of a natural logical deduction in a prepositional calculus', in Siekmann and Wrightson, editors, Automation of Reasoning, vol. 1, 424-483, Springer-Verlag, New York, Berlin. Reprinted from Izdat. Nauka, Moscow, 1965.
24. SlEG, W., Mechanisms and Search: Aspects of Proof Theory, Associazione Italiana di Logica e sue Applicazioni, Padova, 1992.
25. SIEG, W., 'Intercalation calculi for classical logic', Carnegie Mellon Technical Report PHIL-46, Philosophy, Methodology, and Logic, 1994.
26. SlEG, W., and B. KAUFFMANN, 'Unification for quantified formulae', Carnegie Mellon Technical Report PHIL-44, Philosophy, Methodology, and Logic, 1993.
27. SIEG, W., and R. SCHEINES, 'Searching for proofs (in sentential logic)', in L. Burkholder, editor, Philosophy and the Computer, 137-159, Westview Press, Boulder, San Francisco, Oxford, 1992.
28. SNYDER, W., A Proof Theory for General Unification, Rirkhäuser, Rnston, Basel, Berlin, 1991.
29. STÅLMARCK, G., 'Normalization theorems for full first order classical natural deduction', J. Symbolic Logic 56, 1991, 129-149.
30. STATMAN, R., Structural Complexity of Proofs, PhD thesis, Stanford, 1974.
31. TROELSTRA, A. S., and D. VAN UALEN, Constructivism in Mathematics: An Introduction, North Holland, Amsterdam, 1988.