Skip to main content
SpringerLink
Log in

Herbrand Award Acceptance Speech

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

This is a slightly enhanced version of the acceptance speech given by the author after receiving the Herbrand Award at the 19th International Conference on Automated Deduction (CADE-19) in Miami, Florida, on August 1, 2003. Historical matters related to Herbrand's theorem, higher-order logic, and the author's work are discussed. Contributions by others that have been helpful to the author are noted.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Andrews, P. B.: Resolution in type theory, J. Symbolic Logic 36 (1971), 414-432.

    Article  MATH  MathSciNet  Google Scholar 

  2. Andrews, P. B.: Resolution and the consistency of analysis, Notre Dame J. Formal Logic 15(1) (1974), 73-84.

    Article  MATH  MathSciNet  Google Scholar 

  3. Andrews, P. B.: Transforming matings into natural deduction proofs, in W. Bibel and R. Kowalski (eds.), Proceedings of the 5th International Conference on Automated Deduction, Les Arcs, France, Lecture Notes in Comput. Sci. 87, 1980, pp. 281-292.

  4. Andrews, P. B.: Theorem proving via general matings, J. ACM 28 (1981), 193-214.

    Article  MATH  Google Scholar 

  5. Andrews, P. B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn, Kluwer Academic Publishers, 2002.

  6. Andrews, P. B. and Bishop, M.: On sets, types, fixed points, and checkerboards, in P. Miglioli, U. Moscato, D. Mundici and M. Ornaghi (eds.), Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop (TABLEAUX’ 96), Terrasini, Italy, Lecture Notes in Artificial Intelligence 1071, 1996, pp. 1-15.

  7. Andrews, P. B., Bishop, M. and Brown, C. E.: System description: TPS: A theorem proving system for type theory, in [37], 2000, pp. 164-169.

    Google Scholar 

  8. Andrews, P. B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F. and Xi, H.: TPS: An interactive and automatic tool for proving theorems of type theory, in J. J. Joyce and C.-J. H. Seger (eds.), Higher Order Logic Theorem Proving and Its Applications: 6th International Workshop, HUG’ 93, Vancouver, B.C., Canada, Lecture Notes in Comput. Sci. 780, 1994, pp. 366-370.

  9. Andrews, P. B., Bishop, M., Issar, S., Nesmith, D., Pfenning, F. and Xi, H.: TPS: A theorem proving system for classical type theory, J. Automated Reasoning 16 (1996), 321-353.

    Article  MATH  MathSciNet  Google Scholar 

  10. Andrews, P. B. and Brown, C. E.: Tutorial: Using TPS for higher-order theorem proving and ETPS for teaching logic, in [37], 2000, pp. 511-512.

    Google Scholar 

  11. Andrews, P. B. and Cohen, E. L.: Theorem proving in type theory, in Workshop on Automatic Deduction, Cambridge, MA, 1977, 5 pp.

  12. Andrews, P. B. and Cohen, E. L.: Theorem proving in type theory, in Proceedings of the 5th International Joint Conference on Artificial Intelligence, IJCAI-77, MIT, Cambridge, MA, 1977,p. 566.

    Google Scholar 

  13. Andrews, P. B., Issar, S., Nesmith, D. and Pfenning, F.: The TPS theorem proving system, in E. Lusk and R. Overbeek (eds.), Proceedings of the 9th International Conference on Automated Deduction, Argonne, IL, Lecture Notes in Comput. Sci. 310, 1988, pp. 760-761.

  14. Andrews, P. B., Issar, S., Nesmith, D. and Pfenning, F.: The TPS theorem proving system, in [54], 1990, pp. 641-642.

    Google Scholar 

  15. Andrews, P. B., Miller, D. A., Cohen, E. L. and Pfenning, F.: Automating higher-order logic, in W. W. Bledsoe and D. W. Loveland (eds.), Automated Theorem Proving: After 25 Years, Proceedings of the Special Session on Automatic Theorem Proving, 89th Annual Meeting of the American Mathematical Society, held in Denver, Colorado, January 5-9, 1983, 1984,pp. 169-192.

  16. Bishop, M.: A breadth-first strategy for mating search, in H. Ganzinger (ed.), Proceedings of the 16th International Conference on Automated Deduction, Trento, Italy, Lecture Notes in Artificial Intelligence 1632, 1999, pp. 359-373.

  17. Bishop, M.: Mating search without path enumeration, Ph.D. thesis, Department of Mathematical Sciences, Carnegie Mellon University. Department of Mathematical Sciences Research Report No. 99-223, 1999. Available at http://gtps.math.cmu.edu/tps.html.

  18. Bishop, M. and Andrews, P. B.: Selectively instantiating definitions, in C. Kirchner and H. Kirchner (eds.), Proceedings of the 15th International Conference on Automated Deduction, Lindau, Germany, Lecture Notes in Artificial Intelligence 1421, 1998, pp. 365-380.

  19. Brown, C. E.: Solving for set variables in higher-order theorem proving, in A. Voronkov (ed.), Proceedings of the 18th International Conference on Automated Deduction, Copenhagen, Denmark, Lecture Notes in Artificial Intelligence 2392, 2002, pp. 408-422.

  20. Church, A.: A formulation of the simple theory of types, J. Symbolic Logic 5 (1940), 56-68.

    Article  MATH  MathSciNet  Google Scholar 

  21. Davis, M.: Eliminating the irrelevant frommechanical proofs, in Experimental Arithmetic,High Speed Computing and Mathematics, 1963, pp. 15-30.

  22. Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM 7 (1960), 201-215.

    Article  MATH  MathSciNet  Google Scholar 

  23. Dreben, B., Andrews, P. and Aanderaa, S.: False lemmas in Herbrand, Bull. Amer. Math. Soc. 69 (1963), 699-706.

    Article  MATH  MathSciNet  Google Scholar 

  24. Dreben, B. and Denton, J.: A supplement to Herbrand, J. Symbolic Logic 31 (1966), 393-398.

    Article  MATH  MathSciNet  Google Scholar 

  25. Gentzen, G.: Untersuchungen über das Logische Schließen I und II, Math. Z. 39 (1935), 176-210, 405-431. Translated in [26].

    Article  MathSciNet  Google Scholar 

  26. Gentzen, G.: Investigations into logical deductions, in M. E. Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969, pp. 68-131.

    Google Scholar 

  27. Gilmore, P.: A proof method for quantification theory, IBM J. Research and Development 4 (1960), 28-35.

    Article  MATH  MathSciNet  Google Scholar 

  28. Gödel, K.: Collected Works, Vol. IV, Clarendon Press, 2003. Edited by Solomon Feferman, John W. Dawson, Jr., Warren Goldfarb, Charles Parsons, and Wilfried Sieg.

  29. Goldfarb, W. D.: Herbrand’s error and Gödel’s correction, Modern Logic 3(2) (1993), 103-118.

    MATH  MathSciNet  Google Scholar 

  30. Herbrand, J.: Recherches sur la théorie de la démonstration, Travaux de la Société des Sciences et des Lettres de Varsovie, Classe III Sciences Mathematiques et Physiques 33 (1930). Translated in [31].

  31. Herbrand, J.: Logical Writings, Harvard University Press, 1971. Edited by Warren D. Goldfarb.

  32. Hilbert, D. and Bernays, P.: Grundlagen der Mathematik, Vol. 2, Springer, 1939.

  33. Huet, G. P.: A unification algorithm for typed ?-calculus, Theoret. Comput. Sci. 1 (1975), 27-57.

    Article  MATH  MathSciNet  Google Scholar 

  34. Issar, S.: Path-focused duplication: A search procedure for general matings, in AAAI-90. Proceedings of the Eighth National Conference on Artificial Intelligence, Vol. 1, 1990, pp. 221-226.

    Google Scholar 

  35. Issar, S.: Operational issues in automated theorem proving using matings, Ph.D. thesis, Carnegie Mellon University, 1991, 147 pp.

  36. Jensen, D. and Pietrzykowski, T.: Mechanizing ?-order type theory through unification, Theoret. Comput. Sci. 3 (1976), 123-171.

    Article  MathSciNet  Google Scholar 

  37. McAllester, D. (ed.): Proceedings of the 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, Lecture Notes in Artificial Intelligence 1831, Springer-Verlag, 2000.

    Google Scholar 

  38. Miller, D. A.: Proofs in higher-order logic, Ph.D. thesis, Carnegie Mellon University, 1983, 81 pp.

  39. Miller, D. A.: Expansion tree proofs and their conversion to natural deduction proofs, in [51], pp. 375-393.

  40. Miller, D. A.: A compact representation of proofs, Studia Logica 46(4) (1987), 347-370.

    Article  MATH  MathSciNet  Google Scholar 

  41. Miller, D. A., Cohen, E. L. and Andrews, P. B.: A look at TPS, in D. W. Loveland (ed.), Proceedings of the 6th International Conference on Automated Deduction, New York, USA, Lecture Notes in Comput. Sci. 138, 1982, pp. 50-69.

  42. Pfenning, F.: Analytic and non-analytic proofs, in [51], pp. 394-413.

  43. Pfenning, F.: Proof transformations in higher-order logic, Ph.D. thesis, Carnegie Mellon University, 1987, 156 pp.

  44. Pfenning, F. and Nesmith, D.: Presenting intuitive deductions via symmetric simplification, in [54], pp. 336-350.

  45. Prawitz, D.: An improved proof procedure, Theoria 26 (1960), 102-139.

    Article  MATH  MathSciNet  Google Scholar 

  46. Prawitz, D.: Hauptsatz for higher order logic, J. Symbolic Logic 33 (1968), 452-457.

    Article  MATH  MathSciNet  Google Scholar 

  47. Quine, W. V.: A proof procedure for quantification theory, J. Symbolic Logic 20 (1955), 141-149.

    Article  MATH  MathSciNet  Google Scholar 

  48. Robinson, J. A.: A machine-oriented logic based on the resolution principle, J. ACM 12 (1965), 23-41.

    Article  MATH  Google Scholar 

  49. Russell, B.: Mathematical logic as based on the theory of types, Amer. J. Math. 30 (1908), 222-262. Reprinted in [59], pp. 150-182.

    Article  MATH  MathSciNet  Google Scholar 

  50. Schütte, K.: Syntactical and semantical properties of simple type theory, J. Symbolic Logic 25(4) (1960), 305-326.

    Article  MATH  MathSciNet  Google Scholar 

  51. Shostak, R. E. (ed.): Proceedings of the 7th International Conference on Automated Deduction, Napa, California, USA, Lecture Notes in Comput. Sci. 170, Springer-Verlag, 1984.

    Google Scholar 

  52. Smullyan, R. M.: A unifying principle in quantification theory, Proc. Nat. Acad. Sci. U.S.A. 49 (1963), 828-832.

    Article  MATH  MathSciNet  Google Scholar 

  53. Smullyan, R. M.: First-Order Logic, Springer-Verlag, Berlin, 1968.

    MATH  Google Scholar 

  54. Stickel, M. E. (ed.): Proceedings of the 10th International Conference on Automated Deduction, Kaiserslautern, Germany, Lecture Notes in Artificial Intelligence 449, Springer-Verlag, 1990.

    Google Scholar 

  55. Takahashi, M.: A proof of cut-elimination theorem in simple type theory, J. Math. Soc. Japan 19 (1967), 399-410.

    Article  MATH  MathSciNet  Google Scholar 

  56. Takeuti, G.: On a generalized logic calculus, Japan. J. Math. 23 (1953), 39-96. Errata: ibid, 24 (1954), 149-156.

    MATH  MathSciNet  Google Scholar 

  57. Takeuti, G.: Remark on the fundamental conjecture of GLC, J. Math. Soc. Japan 10 (1958), 44-45.

    MATH  MathSciNet  Google Scholar 

  58. TPS and ETPS Homepage. http://gtps.math.cmu.edu/tps.html.

  59. van Heijenoort, J.: From Frege to Gödel. A Source Book in Mathematical Logic 1879-1931, Harvard University Press, Cambridge, MA, 1967.

    MATH  Google Scholar 

  60. Whitehead, A. N. and Russell, B.: Principia Mathematica, Vol. 1, 2nd ed., Cambridge University Press, 1927.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, U.S.A.

    Peter B. Andrews

Authors
  1. Peter B. Andrews
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrews, P.B. Herbrand Award Acceptance Speech. Journal of Automated Reasoning 31, 169–187 (2003). https://doi.org/10.1023/B:JARS.0000009552.54063.f3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JARS.0000009552.54063.f3

Search

Navigation