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 Godel'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.