English
Related papers

Related papers: Computably regular topological spaces

200 papers

A topological space $G$ is said to be a {\it rectifiable space} provided that there are a surjective homeomorphism $\phi :G\times G\rightarrow G\times G$ and an element $e\in G$ such that $\pi_{1}\circ \phi =\pi_{1}$ and for every $x\in G$…

General Topology · Mathematics 2012-03-06 Fucai Lin

We first prove that for all compact metrizable spaces, there exists a topological embedding of the compact metrizable space into each of the sets of compact metric spaces which are connected, path-connected, geodesic, or CAT(0), in the…

Metric Geometry · Mathematics 2022-02-22 Yoshito Ishiki

In this paper we introduce and study so-called $k^*$-metrizable spaces forming a new class of generalized metric spaces, and display various applications of such spaces in topological algebra, functional analysis, and measure theory. By…

General Topology · Mathematics 2011-10-11 T. O. Banakh , V. I. Bogachev , A. V. Kolesnikov

Numerably contractible spaces play an important role in the theory of homotopy pushouts and pullbacks. The corresponding results imply that a number of well known weak homotopy equivalences are genuine ones if numerably contractible spaces…

Algebraic Topology · Mathematics 2014-10-01 E. Schwamberger , R. Vogt

We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…

Geometric Topology · Mathematics 2007-05-23 Kenneth J. Shackleton

The famous Rosenthal-Lacey theorem asserts that for each infinite compact set $K$ the Banach space $C(K)$ admits a quotient which is either a copy of $c$ or $\ell_{2}$. What is the case when the uniform topology of $C(K)$ is replaced by the…

General Topology · Mathematics 2020-04-09 T. Banakh , J. Kąkol , W. Śliwa

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

Differential Geometry · Mathematics 2024-07-18 Gustave Bainier , Benoit Marx , Jean-Christophe Ponsart

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Logic · Mathematics 2024-01-29 Wesley Calvert , Douglas Cenzer , David Gonzalez , Valentina Harizanov

It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…

Logic · Mathematics 2007-06-13 Dmitry Sustretov

We classify 'primitive normal compactifications' of C^2 (i.e. normal analytic surfaces containing C^2 for which the curve at infinity is irreducible), compute the moduli space of these surfaces and their groups of auomorphisms. In…

Algebraic Geometry · Mathematics 2016-09-20 Pinaki Mondal

A separable space is strongly sequentially separable if, for each countable dense set, every point in the space is a limit of a sequence from the dense set. We consider this and related properties, for the spaces of continous and Borel…

General Topology · Mathematics 2019-11-11 Alexander V. Osipov , Piotr Szewczak , Boaz Tsaban

In the absence of the Axiom of Choice, necessary and sufficient conditions for a locally compact Hausdorff space to have all non-empty second-countable compact Hausdorff spaces as remainders are given in $\mathbf{ZF}$. Among other…

General Topology · Mathematics 2020-09-22 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, to the ones he asked, is to give a precise description of the notion of algorithm. In the search for a good definition arose three…

Logic in Computer Science · Computer Science 2021-08-23 Ciro Ivan Garcia Lopez

Here we have investigated some aspects of $s\lambda$-closed sets on separation axioms including $s T_{2\frac{1}{2}} $ and $s T_{3\frac{1}{2}} $ axioms and on compactness in generalized topological spaces

General Topology · Mathematics 2021-12-21 Amar Kumar Banerjee , Jagannath Pal

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

Logic · Mathematics 2020-02-06 S. A. Terwijn

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

Logic · Mathematics 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian

An orbifold version of Bogomolov decomposition theorem is established for compact K\"ahler spaces with quotient singularities and first Chern class zero.The proof is a direct adaptation of the classical smooth case, using Ricci-flat…

Algebraic Geometry · Mathematics 2007-05-23 Frederic Campana

A topological space $X$ is defined to have a neighborhood $P$-base at any $x\in X$ from some poset $P$ if there exists a neighborhood base $(U_p[x])_{p\in P}$ at $x$ such that $U_p[x]\subseteq U_{p'}[x]$ for all $p\geq p'$ in $P$. We prove…

General Topology · Mathematics 2021-05-21 Ziqn Feng

We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…

General Topology · Mathematics 2018-06-06 Frank Waaldijk

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

Logic in Computer Science · Computer Science 2018-12-11 Akitoshi Kawamura , Donghyun Lim , Svetlana Selivanova , Martin Ziegler