Pages that link to "Item:Q3535608"
From MaRDI portal
The following pages link to Exhaustible sets in higher-type computation (Q3535608):
Displaying 11 items.
- The Peirce translation (Q408162) (← links)
- Bar recursion over finite partial functions (Q515562) (← links)
- Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (Q2805159) (← links)
- (Q3384909) (← links)
- Computability of Continuous Solutions of Higher-Type Equations (Q3576051) (← links)
- Nonflatness and totality (Q4611200) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Admissibly Represented Spaces and Qcb-Spaces (Q5024575) (← links)
- Higher-order games with dependent types (Q6049932) (← links)
- Apartness, sharp elements, and the Scott topology of domains (Q6190408) (← links)
- Sharp elements and apartness in domains (Q6653753) (← links)
