Abstract
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 given well-partial ordering on the same domain is automatically well-founded. In this article it is shown by purely combinatorial means that the maximal order type of the homeomorphic embeddability relation on a given set of terms over a finite signature yields an appropriate ordinal recursive Hardy bound on the lengths of bad sequences which satisfy an effective growth rate condition. This result yields theoretical upper bounds for the computational complexity of algorithms, for which termination can be proved by Kruskal's theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.