Exhaustible sets in higher-type computation

@article{Escard2008ExhaustibleSI,
  title={Exhaustible sets in higher-type computation},
  author={Mart{\'i}n H{\"o}tzel Escard{\'o}},
  journal={Logical Methods in Computer Science},
  year={2008},
  volume={4}
}
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… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 46 references

Totale Objekte und Mengen in der Bereichstheorie

  • U. Berger
  • PhD thesis, Mathematisches Institut der Universit…
  • 1990
Highly Influential
7 Excerpts

Recursion on the countable functionals

  • D. Normann
  • volume 811 of Lec. Not. Math. Springer
  • 1980
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…