[图书][B] Non-Hausdorff topology and domain theory: Selected topics in point-set topology

J Goubault-Larrecq - 2013 - books.google.com
This unique book on modern topology looks well beyond traditional treatises and explores
spaces that may, but need not, be Hausdorff. This is essential for domain theory, the …

[图书][B] Higher-order computability

J Longley, D Normann - 2015 - Springer
This book serves as an introduction to an area of computability theory that originated in the
1950s, and since then has fanned out in many different directions under the influence of …

[PDF][PDF] Equivariant principal∞-bundles

H Sati, U Schreiber - arXiv preprint arXiv:2112.13654, 2022 - ncatlab.org
In this book we prove (Thm. 4. 3.24) unified classification results for stable equivariant Γ-
principal bundles when the underlying homotopy type SΓ of the topological structure group Γ …

[HTML][HTML] On T0 spaces determined by well-filtered spaces

X Xu, C Shen, X Xi, D Zhao - Topology and its Applications, 2020 - Elsevier
We first introduce and study two new classes of subsets in T 0 spaces—Rudin sets and WD
sets lying between the class of all closures of directed subsets and that of irreducible closed …

D-completions and the d-topology

K Keimel, JD Lawson - Annals of Pure and Applied Logic, 2009 - Elsevier
In this article we give a general categorical construction via reflection functors for various
completions of T0-spaces subordinate to sobrification, with a particular emphasis on what …

[HTML][HTML] On topological Rudin's lemma, well-filtered spaces and sober spaces

X Xu, D Zhao - Topology and its Applications, 2020 - Elsevier
Based on topological Rudin's Lemma, we investigate two new kinds of sets–Rudin sets and
well-filtered determined sets in T 0 topological spaces. Using such sets, we formulate and …

Selection functions, bar recursion and backward induction

M Escardó, P Oliva - Mathematical structures in computer science, 2010 - cambridge.org
Bar recursion arises in constructive mathematics, logic, proof theory and higher-type
computability theory. We explain bar recursion in terms of sequential games, and show how …

First-countability, ω-Rudin spaces and well-filtered determined spaces

X Xu, C Shen, X Xi, D Zhao - Topology and its Applications, 2021 - Elsevier
In this paper, we investigate some versions of d-space, well-filtered space and Rudin space
concerning various countability properties. It is proved that every T 0 space with a first …

Admissibly represented spaces and Qcb-spaces

M Schröder - Handbook of computability and complexity in analysis, 2021 - Springer
A basic concept of Type Two Theory of Effectivity (TTE) is the notion of an admissibly
represented space. Admissibly represented spaces are closely related to qcb-spaces. The …

Some open problems on well-filtered spaces and sober spaces

X Xu, D Zhao - Topology and its Applications, 2021 - Elsevier
In the past few years, the research on sober spaces and well-filtered spaces has got some
breakthrough progress. In this paper, we shall present a brief summarizing survey on some …