Exhaustible sets in higher-type computation
From MaRDI portal
Publication:3535608
DOI10.2168/LMCS-4(3:3)2008zbMath1151.03022OpenAlexW2151637386MaRDI QIDQ3535608
Publication date: 13 November 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-4(3:3)2008
Cantor spacedecidable setsexhaustible setsalgorithmic universal quantificationcontinuous predicatehierarchy of continuous functionalssearchable sets
Related Items (10)
Higher-order games with dependent types ⋮ The Peirce translation ⋮ Apartness, sharp elements, and the Scott topology of domains ⋮ Nonflatness and totality ⋮ Unnamed Item ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Bar recursion over finite partial functions ⋮ Computability of Continuous Solutions of Higher-Type Equations ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting ⋮ Admissibly Represented Spaces and Qcb-Spaces
This page was built for publication: Exhaustible sets in higher-type computation
