A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors

Arvind Gupta. A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors. In Anil Nerode, Michael A. Taitslin, editors, Logical Foundations of Computer Science - Tver 92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings. Volume 620 of Lecture Notes in Computer Science, pages 174-185, Springer, 1992.

Abstract

Abstract is missing.