Pages that link to "Item:Q515562"
From MaRDI portal
The following pages link to Bar recursion over finite partial functions (Q515562):
Displaying 11 items.
- The equivalence of bar recursion and open recursion (Q400424) (← 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)
- On Spector's bar recursion (Q2910991) (← links)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs (Q3305635) (← links)
- ON THE UNCOUNTABILITY OF (Q5052009) (← 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)
- (Q6161780) (← links)