Pages that link to "Item:Q5225855"
From MaRDI portal
The following pages link to An analysis of the Podelski–Rybalchenko termination theorem via bar recursion (Q5225855):
Displaying 8 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Equivalence of bar induction and bar recursion for continuous functions with continuous moduli (Q2417961) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM (Q4638975) (← links)
- (Q5144612) (← links)
- Bar recursion is not computable via iteration (Q5211057) (← links)