Proving Open Properties by Induction
暂无分享,去创建一个
Well-founded orders are the opposite of noetherian orders: every nonempty subset contains at least one minimal element. And a set is well-ordered when it is totally ordered by a wellfounded order: every nonempty set contains exactly one minimal element. Sofar, noetherian induction has been the most powerful way of proving properties inductively; it is indeed the most general one in the precise sence.
[1] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .
[2] C. Smoryński,et al. The varieties of arboreal experience , 1982 .
[3] K. Hofmann,et al. A Compendium of Continuous Lattices , 1980 .
[4] George Gratzer,et al. Universal Algebra , 1979 .