Kruskal's Tree Theorem

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certainorderings on Trees are well-founded. These orderings play a crucial role in proving the termination ofrewriting rules and the correctness of the Knuth-Bendix equational completion procedures.

References

Gallier, J. ``What's so Special about Kruskal's Theorem and the Ordinal Gamma[0]? A Survey of Some Results in Proof Theory.'' Ann. Pure and Appl. Logic 53, 199-260, 1991.

• Heegaard Splitting
• Heegner Number
• Heesch Number
• Heesch's Problem
• Height
• Heilbronn Triangle Problem
• Heine-Borel Theorem
• Heine Hypergeometric Series
• Heisenberg Group
• Heisenberg Space
• Held Group
• Helen of Geometers
• Helicoid
• Helix
• Helly Number
• Helly's Theorem
• Helmholtz Differential Equation
• Helmholtz Differential Equation--Bipolar Coordinates
• Helmholtz Differential Equation--Cartesian Coordinates
• Helmholtz Differential Equation--Circular Cylindrical Coordinates
• Helmholtz Differential Equation--Confocal Ellipsoidal Coordinates
• Helmholtz Differential Equation--Confocal Paraboloidal Coordinates
• Helmholtz Differential Equation--Conical Coordinates
• Helmholtz Differential Equation--Elliptic Cylindrical Coordinates
• Helmholtz Differential Equation--Oblate Spheroidal Coordinates