A Combinatorial Bound for a Restricted Form of the Termination Theorem

DOI10.1007/978-3-030-30229-0_11zbMath1496.03243OpenAlexW2998416452MaRDI QIDQ3295155

Silvia Steila

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-30229-0_11

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Hierarchies of computability and definability (03D55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reverse mathematical bounds for the termination theorem
• An intuitionistic version of Ramsey's theorem and its use in program termination
• Rapidly growing Ramsey functions
• The theory of well-quasi-ordering: a frequently discovered concept
• Transition Invariants and Transition Predicate Abstraction for Program Termination
• An analysis of the Podelski–Rybalchenko termination theorem via bar recursion
• Hierarchies of number-theoretic functions. I
• Ramsey's theorem and recursion theory

This page was built for publication: A Combinatorial Bound for a Restricted Form of the Termination Theorem