101 citations · 167 across the 6 of their papers we have counts for
6 papers
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
Matthew de Brecht, Takayuki Kihara, Victor Selivanov
The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of…
A generalization of a theorem of Hurewicz for quasi-Polish spaces
Matthew de Brecht
We identify four countable topological spaces , , , and which serve as canonical examples of topological spaces which fail to be quasi-Polish. These four space…
On the commutativity of the powerspace constructions
Matthew de Brecht, Tatsuji Kawai
We investigate powerspace constructions on topological spaces, with a particular focus on the category of quasi-Polish spaces. We show that the upper and lower powerspaces commute…
Non-deterministic computation and the Jayne-Rogers Theorem
Arno Pauly, Matthew de Brecht
We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaini…
Towards Synthetic Descriptive Set Theory: An instantiation with represented spaces
Arno Pauly, Matthew de Brecht
Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in…
Closed Choice and a Uniform Low Basis Theorem
Vasco Brattka, Matthew de Brecht, Arno Pauly
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed c…