Pages that link to "Item:Q400424"
From MaRDI portal
The following pages link to The equivalence of bar recursion and open recursion (Q400424):
Displaying 14 items.
- Bar recursion over finite partial functions (Q515562) (← links)
- Equivalence of bar recursors in the theory of functionals of finite type (Q1115867) (← links)
- Dependent choice as a termination principle (Q2309508) (← links)
- Equivalence of bar induction and bar recursion for continuous functions with continuous moduli (Q2417961) (← links)
- A universal algorithm for Krull's theorem (Q2672666) (← links)
- System T and the product of selection functions (Q2915685) (← links)
- Well Quasi-orders and the Functional Interpretation (Q3295153) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM (Q4638975) (← links)
- (Q5144612) (← links)
- Bar recursion is not computable via iteration (Q5211057) (← links)
- BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS (Q5251356) (← links)
- Logical Approaches to Computational Barriers (Q5898840) (← links)
- Higher-order games with dependent types (Q6049932) (← links)