Journal of Automated Reasoning

, Volume 29, Issue 1, pp 67–89 | Cite as

Hilbert's Twenty-Fourth Problem

  • Ruediger Thiele
  • Larry Wos
Article

Abstract

For almost a century, a treasure lay hidden in a library in Germany, hidden until a remarkable discovery was made. Indeed, for most of the twentieth century, all of science thought that Hilbert had posed twenty-three problems, and no others. In the mid-1990s, however, as a result of a thorough reading of Hilbert's files, a twenty-fourth problem was found (in a notebook, in file Cod. ms. D. Hilbert 600:3), a problem that might have a profound effect on research. This newly discovered problem focuses on the finding of simpler proofs and criteria for measuring simplicity. A proof may be simpler than previously known in one or more ways that include length, size (measured in terms of the total symbol count), and term structure. A simpler proof not only is more appealing aesthetically (and has fascinated masters of logic including C. A. Meredith, A. Prior, and I. Thomas) but is relevant to practical applications such as circuit design and program synthesis. This article presents Hilbert's twenty-fourth problem, discusses its relation to certain studies in automated reasoning, and offers researchers with varying interests the challenge of addressing this newly discovered problem. In particular, we include open questions to be attacked, questions that (in different ways and with diverse proof refinements as the focus) may prove of substantial interest to mathematicians, to logicians, and (perhaps in a slightly different manner) to those researchers primarily concerned with automated reasoning.

automated reasoning proof refinement Hilbert 24th problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrow, J.: The World within the World, Clarendon Press, Oxford, 1988.Google Scholar
  2. 2.
    Fitelson, B. and Wos, L.: Missing proofs found, J. Automated Reasoning 27(2) (2001), 201–225.Google Scholar
  3. 3.
    Grattan-Guinness, I.: A sideways look at Hilbert's twenty-three problems of 1900, Notices of the Amer. Math. Soc. 47 (August 2000), 752–757.Google Scholar
  4. 4.
    Grattan-Guinness, I.: The Search for Mathematical Roots, 1870–1940: Logics, Set Theories and the Foundations of Mathematics from Cantor through Russell to Goedel, Princeton University Press, Princeton, 2000.Google Scholar
  5. 5.
    Łukasiewicz, J.: Selected Works, edited by L. Borokowski, North-Holland, Amsterdam, 1970.Google Scholar
  6. 6.
    McCune, W.: OTTER 3.0 reference manual and guide, Tech. Report ANL-94/6, Argonne National Laboratory, Argonne, IL, 1994.Google Scholar
  7. 7.
    McCune, W. and Padmanabhan, R.: Automated Deduction in Equational Logic and Cubic Curves, Lecture Notes in Comput. Sci. 1095, Springer-Verlag, Heidelberg, 1996. See http://www.mcs.anl.gov/home/mccune/ar/monograph/ for additional information.Google Scholar
  8. 8.
    Meredith, C. A. and Prior, A.: Notes on the axiomatics of the propositional calculus, Notre Dame J. Formal Logic 4(3) (1963), 171–187.Google Scholar
  9. 9.
    Minkowski, H.: Briefe an David Hilbert, Springer, Berlin, 1973.Google Scholar
  10. 10.
    Norton, J. D.: Nature is the realization of the simplest conceivable mathematical ideas, Stud. Hist. Mod. Phys. 31(2) (2000), 135–170.Google Scholar
  11. 11.
    Reid, C.: Hilbert, Springer, New York, 1970, reprinted 1996, Copernicus ed.Google Scholar
  12. 12.
    Thomas, I.: Shorter development of an axiom, Notre Dame J. Formal Logic 16 (1975), 378.Google Scholar
  13. 13.
    Veroff, R.: Using hints to increase the effectiveness of an automated reasoning program: Case studies, J. Automated Reasoning 16(3) (1996), 223–239.Google Scholar
  14. 14.
    Veroff, R.: Finding shortest proofs: An application of linked inference rules, J. Automated Reasoning 21(2) (2001), 123–139Google Scholar
  15. 15.
    Veroff, R.: Solving open questions and other challenge problems using proof sketches, J. Automated Reasoning 21(2) (2001), 157–174.Google Scholar
  16. 16.
    Wos, L.: Automating the search for elegant proofs, J. Automated Reasoning 21 (1998), 135–175.Google Scholar
  17. 17.
    Wos, L. and Pieper, G. W.: A Fascinating Country in the World of Computing: Your Guide to Automated Reasoning, World Scientific, Singapore, 1999.Google Scholar
  18. 18.
    Wos, L. and Pieper, G. W.: The Collected Works of Larry Wos, World Scientific, Singapore, 2000.Google Scholar
  19. 19.
    Wos, L.: The strategy of cramming, Preprint ANL/MCS-P898-0801, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 2001.Google Scholar

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Ruediger Thiele
    • 1
  • Larry Wos
    • 2
  1. 1.Karl-Sudhoff-Institut fur Geschichte der Medizin und NaturwissenschaftenUniversität LeipzigGermany
  2. 2.Mathematics and Computer Science DivisionArgonne National LaboratoryArgonneU.S.A. e-mail

Personalised recommendations