Program termination and well partial orderings

DOI10.1145/1352582.1352586zbMath1367.68061OpenAlexW1967109918MaRDI QIDQ5277807

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)

Related Items (10)

Guessing and non-guessing of canonical functions ⋮ Jumping and escaping: modular termination and the abstract path ordering ⋮ Infinitary Noetherian constructions II. Transfinite words and the regular subword topology ⋮ The length of an intersection ⋮ The maximal linear extension theorem in second order arithmetic ⋮ Free choice in modal inquisitive logic ⋮ Unnamed Item ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ The Reverse Mathematics of wqos and bqos ⋮ An infinite natural product

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