English
Related papers

Related papers: Strong completions of spaces

200 papers

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$-spaces instead of restricting to posets. In this paper, we respond to this calling by…

Logic in Computer Science · Computer Science 2017-09-12 Hadrian Andradi , Weng Kin Ho

We first introduce and investigate a new class of $T_0$ spaces -- strong R-spaces, which are stronger than both R-spaces and strongly well-filtered spaces. It is proved that any sup-complete poset equipped with the upper topology is a…

General Topology · Mathematics 2025-12-12 Xiaoquan Xu , Yi Yang , Lizi Chen

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling by…

Logic in Computer Science · Computer Science 2016-07-06 Hadrian Andradi , Weng Kin Ho

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of…

Logic in Computer Science · Computer Science 2021-12-30 Tom de Jong

Working constructively, we study continuous directed complete posets (dcpos) and the Scott topology. Our two primary novelties are a notion of intrinsic apartness and a notion of sharp elements. Being apart is a positive formulation of…

Logic · Mathematics 2023-09-13 Tom de Jong

In this paper, we highlight some open problems stated by Xu and Zhao. In particular, we focus on strong $d$-spaces and answer two open problems concerning strong $d$-spaces. One is about the product space of an arbitrary family of strong…

General Topology · Mathematics 2021-09-24 Mengjie Jin , Hualin Miao , Qingguo Li

We investigate two approximation relations on a T0 topological space, the n-approximation, and the d-approximation, which are generalizations of the way-below relation on a dcpo. Different kinds of continuous spaces are defined by the two…

General Topology · Mathematics 2022-07-08 Yuxu Chen , Hui Kou , Zhenchao Lyu

We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…

Logic in Computer Science · Computer Science 2024-07-19 Tom de Jong

Let $S$ be an integral domain with field of fractions $F$ and let $A$ be an $F$-algebra. An $S$-subalgebra $R$ of $A$ is called $S$-nice if $R$ is lying over $S$ and the localization of $R$ with respect to $S \setminus \{ 0 \}$ is $A$. Let…

Rings and Algebras · Mathematics 2019-04-23 Shai Sarussi

We first introduce and study two new classes of subsets in $T_0$ spaces - Rudin sets and $\wdd$ sets lying between the class of all closures of directed subsets and that of irreducible closed subsets. Using such subsets, we define three new…

General Topology · Mathematics 2019-09-23 Xiaoquan Xu , Chong Shen , Xiaoyong Xi , Dongsheng Zhao

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…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

We consider a topological space with its subbase which induces a coding for each point. Every second-countable Hausdorff space has a subbase that is the union of countably many pairs of disjoint open subsets. A dyadic subbase is such a…

General Topology · Mathematics 2023-06-22 Yasuyuki Tsukamoto

We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…

Logic in Computer Science · Computer Science 2023-09-29 Tom de Jong

Recursive domain equations have natural solutions. In particular there are domains defined by strictly positive induction. The class of countably based domains gives a computability theory for possibly non-countably based topological…

Logic in Computer Science · Computer Science 2015-07-01 Petter Kristian Køber

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…

Logic in Computer Science · Computer Science 2023-06-22 Hadrian Andradi , Weng Kin Ho

We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete…

Logic · Mathematics 2022-06-16 Tom de Jong , Martín Hötzel Escardó

In this paper, we provide a uniform approach to $d$-spaces, sober spaces and well-filtered spaces, and develop a general framework for dealing with all these spaces. For a subset system H, the theory of H-sober spaces and super H-sober…

General Topology · Mathematics 2020-03-18 Xiaoquan Xu

The aim of this paper is to study the topological properties of some classes of subsemimodules endowed with a subbasis closed-set topology. We show that such spaces are $T_0$. When the semimodule is finitely generated, those spaces are…

Rings and Algebras · Mathematics 2023-03-02 Amartya Goswami

In analogy to a result due to Drake and Thron about topological spaces, this paper studies the dcpos (directed complete posets) which are fully determined, among all dcpos, by their lattices of all Scott-closed subsets (such dcpos will be…

General Topology · Mathematics 2023-06-22 Dongsheng Zhao , Luoshan Xu
‹ Prev 1 2 3 10 Next ›