The Strength of the SCT Criterion

DOI10.1007/978-3-319-55911-7_19zbMath1459.03010arXiv1611.05176OpenAlexW2568243403WikidataQ61834870 ScholiaQ61834870MaRDI QIDQ2988827

Emanuele Frittaion, Keita Yokoyama, Silvia Steila

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.05176

zbMATH Keywords

reverse mathematicsRamsey's theorem for pairssize-change termination\(\Sigma ^0_2\)-induction

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Unnamed Item
• Unnamed Item
• Reverse mathematical bounds for the termination theorem
• The size-change principle and dependency pairs for termination of term rewriting
• Transition Invariants and Transition Predicate Abstraction for Program Termination
• Size-Change Termination and Transition Invariants
• The size-change principle for program termination
• Hierarchies of number-theoretic functions. I
• Rewriting Techniques and Applications

This page was built for publication: The Strength of the SCT Criterion