34 citations · 50 across the 9 of their papers we have counts for
1 paper · 1 filter
Martin Escardo
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…