An analysis of the Podelski–Rybalchenko termination theorem via bar recursion

DOI10.1093/logcom/exv058zbMath1444.03140OpenAlexW2563354002MaRDI QIDQ5225855

Stefano Berardi, Paulo Oliva, Silvia Steila

Publication date: 29 July 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exv058

zbMATH Keywords

Ramsey's theoremtermination theoremintuitionismbar recursionwell-foundedness

Mathematics Subject Classification ID

Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35) Intuitionistic mathematics (03F55) Higher-type and set recursion theory (03D65)

Related Items (4)

Reverse mathematical bounds for the termination theorem ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM

This page was built for publication: An analysis of the Podelski–Rybalchenko termination theorem via bar recursion