Program termination and well partial orderings

DOI10.1145/1352582.1352586MaRDI QIDQ5277807zbMATH OpenOpenAlexFDO

Authors Andreas Blass, Yuri Gurevich

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1352582.1352586

zbMATH Keywords

covering observationgame criterionprogram terminationwell partial orderings

Mathematics Subject Classification ID

Ordinal and cardinal numbers (03E10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Complexity bounds for ordinal-based termination (invited talk)
• Complexity bounds for some finite forms of Kruskal's theorem
• Proof-theoretic analysis of termination proofs
• Reverse mathematical bounds for the termination theorem
• Well-partial orderings and their maximal order types

Cited in

(13)

• An infinite natural product
• Jumping and escaping: modular termination and the abstract path ordering
• Free choice in modal inquisitive logic
• On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
• The reverse mathematics of wqos and bqos
• The length of an intersection
• Infinitary Noetherian constructions II. Transfinite words and the regular subword topology
• Statures and sobrification ranks of Noetherian spaces
• The maximal linear extension theorem in second order arithmetic
• Well partial orders
• On the width of the Cartesian product of ordinals
• Well quasi-orders, better quasi-orders, and monomial ideals
• Guessing and non-guessing of canonical functions

This page was built for publication: Program termination and well partial orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277807)