The composition heuristic
An essential heuristic in the SHUNYATA program is the composition heuristic which produces predicates and formulas forming the central “ideas” of proofs. In the proof of a rather simple theorem in mathematical logic, it generates a predicate. In the proof of Gödel's incompleteness theorem, it generates an undecidable formula. The construction of the above predicate and the undecidable formula ordinarily requires the application of Cantor's famous diagonal method. The composition heuristic was originally developed as a learning procedure which generates theorem provers automatically.
Unable to display preview. Download preview PDF.
- 1.Ammon, K., The Automatic Development of Concepts and Methods. Doctoral dissertation, Department of Computer Science, University of Hamburg, 1988.Google Scholar
- 2.Ammon, K., The automatic acquisition of proof methods, Seventh National Conference on Artificial Intelligence, Saint Paul, Minnesota, 1988.Google Scholar
- 3.Ammon, K., Automatic proofs in mathematical logic and analysis. 11th International Conference on Automated Deduction, Saratoga Springs, NY, 1992.Google Scholar
- 4.Ammon, K., The SHUNYATA system. 11th International Conference on Automated Deduction, Saratoga Springs, NY, 1992.Google Scholar
- 6.Bibel, W., Automated Theorem Proving. Vieweg, Braunschweig, 1982.Google Scholar
- 8.Gödel, K., über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, Vol. 38, pp. 173–198.Google Scholar
- 9.Kleene, S. C., Introduction to Metamathematics. North-Holland, Amsterdam, 1952.Google Scholar
- 11.Loveland, D. W., Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam, 1978.Google Scholar
- 12.Mendelson, E., Introduction to Mathematical Logic. Van Nostrand Reinhold, New York, 1964.Google Scholar