Matthew de Brecht

dblp:35/2717 · DBLP profile ↗
← Back
17ranked-venue papers
15as first author
3since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 12 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 3 first-author
YearPublicationVenuePosition
2026 A Note on Computable Étale Spaces
Matthew de Brecht
CiE1
2022 Enumerating Classes of Effective Quasi-Polish Spaces
Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov
CiE1
2022 Constructing the Space of Valuations of a Quasi-Polish Space as a Space of Ideals
abstract
We construct the space of valuations on a quasi-Polish space in terms of the characterization of quasi-Polish spaces as spaces of ideals of a countable transitive relation. Our construction is closely related to domain theoretical work on the probabilistic powerdomain, and helps illustrate the connections between domain theory and quasi-Polish spaces. Our approach is consistent with previous work on computable measures, and can be formalized within weak formal systems, such as subsystems of second order arithmetic.
Matthew de Brecht
CSL1
2020 Some Notes on Spaces of Ideals and Computable Topology
Matthew de Brecht
CiE1
2019 On the commutativity of the powerspace constructions
abstract
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 on all quasi-Polish spaces, and show more generally that this commutativity is equivalent to the topological property of consonance. We then investigate powerspace constructions on the open set lattices of quasi-Polish spaces, and provide a complete characterization of how the upper and lower powerspaces distribute over the open set lattice construction.
Matthew de Brecht, Tatsuji Kawai
Log. Methods Comput. Sci.1
2018 A generalization of a theorem of Hurewicz for quasi-Polish spaces
abstract
We identify four countable topological spaces $S_2$, $S_1$, $S_D$, and $S_0$ which serve as canonical examples of topological spaces which fail to be quasi-Polish. These four spaces respectively correspond to the $T_2$, $T_1$, $T_D$, and $T_0$-separation axioms. $S_2$ is the space of rationals, $S_1$ is the natural numbers with the cofinite topology, $S_D$ is an infinite chain without a top element, and $S_0$ is the set of finite sequences of natural numbers with the lower topology induced by the prefix ordering. Our main result is a generalization of Hurewicz's theorem showing that a co-analytic subset of a quasi-Polish space is either quasi-Polish or else contains a countable $\Pi^0_2$-subset homeomorphic to one of these four spaces.
Matthew de Brecht
Log. Methods Comput. Sci.1
2017 Noetherian Quasi-Polish spaces
abstract
In the presence of suitable power spaces, compactness of $\mathbf{X}$ can be characterized as the singleton $\{X\}$ being open in the space $\mathcal{O}(\mathbf{X})$ of open subsets of $\mathbf{X}$. Equivalently, this means that universal quantification over a compact space preserves open predicates. Using the language of represented spaces, one can make sense of notions such as a $Σ^0_2$-subset of the space of $Σ^0_2$-subsets of a given space. This suggests higher-order analogues to compactness: We can, e.g.~, investigate the spaces $\mathbf{X}$ where $\{X\}$ is a $Δ^0_2$-subset of the space of $Δ^0_2$-subsets of $\mathbf{X}$. Call this notion $\nabla$-compactness. As $Δ^0_2$ is self-dual, we find that both universal and existential quantifier over $\nabla$-compact spaces preserve $Δ^0_2$ predicates. Recall that a space is called Noetherian iff every subset is compact. Within the setting of Quasi-Polish spaces, we can fully characterize the $\nabla$-compact spaces: A Quasi-Polish space is Noetherian iff it is $\nabla$-compact. Note that the restriction to Quasi-Polish spaces is sufficiently general to include plenty of examples.
Matthew de Brecht, Arno Pauly
CSL1
2015 Base-Complexity Classifications of QCB0-Spaces
Matthew de Brecht, Matthias Schröder 0001, Victor L. Selivanov
CiE1
2015 Descriptive Set Theory in the Category of Represented Spaces
abstract
We propose to extend descriptive set theory (DST) beyond its traditional setting of Polish spaces to the represented spaces. There, we can reformulate DST in terms of endofunctors on the categories of represented spaces and computable or continuous functions. In particular, this approach satisfies the demand for a uniform approach to both classic and effective DST -- computability follows naturally from the setting, rather than having to be explicitly demanded. The previous endeavour to extend DST to the Quasi-Polish spaces is subsumed by this work. In several cases the category-theoretic setting enables new, very succinct proofs, and sheds a new light on why certain results are true. The framework lets us make formal some natural questions not easily approachable by traditional methods.
Arno Pauly, Matthew de Brecht
LICS2
2013 Quasi-Polish spaces
Matthew de Brecht
Ann. Pure Appl. Log.1
2012 Closed choice and a Uniform Low Basis Theorem
Vasco Brattka, Matthew de Brecht, Arno Pauly
Ann. Pure Appl. Log.2
2010 Topological properties of concept spaces (full version)
Matthew de Brecht, Akihiro Yamamoto
Inf. Comput.1
2010 Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
Matthew de Brecht, Akihiro Yamamoto
Theor. Comput. Sci.1
2009 Sigma^0_alpha - Admissible Representations (Extended Abstract)
Matthew de Brecht, Akihiro Yamamoto
CCA1
2008 Topological Properties of Concept Spaces
Matthew de Brecht, Akihiro Yamamoto
ALT1
2006 Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
Matthew de Brecht, Akihiro Yamamoto
ALT1
2006 A neural network implementation of a saliency map model
Matthew de Brecht, Jun Saiki
Neural Networks1