Exhaustible sets in higher-type computation

Abstract

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate holds or else tells there is no example. The Cantor space of infinite sequences of binary digits is known to be searchable. Searchable sets are exhaustible, and we show that the converse also holds for sets of hereditarily total elements in the hierarchy of continuous functionals; moreover, a selection functional can be constructed uniformly from a quantification functional. We prove that searchable sets are closed under intersections with decidable sets, and under the formation of computable images and of finite and countably infinite products. This is related to the fact, established here, that exhaustible sets are topologically compact. We obtain a complete description of exhaustible total sets by developing a computational version of a topological Arzela--Ascoli type characterization of compact subsets of function spaces. We also show that, in the non-empty case, they are precisely the computable images of the Cantor space. The emphasis of this paper is on the theory of exhaustible and searchable sets, but we also briefly sketch applications.

References in corpus (1)

• Comparing hierarchies of total functionals

Cited by in corpus (10)

• Monad Transformers for Backtracking Search
• Products of effective topological spaces and a uniformly computable Tychonoff Theorem
• On the topological aspects of the theory of represented spaces
• Sharp Elements and Apartness in Domains
• Backward Induction for Repeated Games
• Spector bar recursion over finite partial functions
• Bar Recursion and Products of Selection Functions
• Higher-Order Game Theory
• Apartness, sharp elements, and the Scott topology of domains
• A Constructive, Type-Theoretic Approach to Regression via Global Optimisation