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

program terminationwell partial orderingscovering observationgame criterion

Mathematics Subject Classification ID

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

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

(12)

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

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)