๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some theorems about bounded structures

โœ Scribed by Lucien Waelbroeck


Publisher
Elsevier Science
Year
1967
Tongue
English
Weight
980 KB
Volume
1
Category
Article
ISSN
0022-1236

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complexity Bounds for Some Finite Forms
โœ Andreas Weiermann ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

Well-founded (partial) orders form an important and convenient mathematical basis for proving termination of algorithms. Well-partial orders provide a powerful method for proving the well-foundedness of partial orders (and hence for proving termination), since every partial ordering which extends a