English
Related papers

Related papers: Co-c.e. spheres and cells in computable metric spa…

200 papers

Quantum steering describes the ability of one observer to nonlocally affect the other observer's state through local measurements, which represents a new form of quantum nonlocal correlation and has potential applications in quantum…

Quantum Physics · Physics 2020-10-06 Guo-Zhu Pan , Jun-Long Zhao , Zhi Lin , Ming Yang , Gang Zhang , Zhuo-Liang Cao

Nearly all cell models explicitly or implicitly deal with the biophysical constraints that must be respected for life to persist. Despite this, there is almost no systematicity in how these constraints are implemented, and we lack a…

Cell Behavior · Quantitative Biology 2026-05-20 Connor McShaffrey , Eran Agmon , Randall D. Beer

Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…

Classical Analysis and ODEs · Mathematics 2017-02-14 Iosif Pinelis

The approximation of natural numbers subsets has always been one of the fundamental issues in computability theory. Computable approximation, $\Delta_2$-approximation, as well as introducing the generically computable sets have been some…

Logic in Computer Science · Computer Science 2019-02-12 Mohsen Mansouri , Farzad Didehvar

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Logic · Mathematics 2015-10-27 Russell Miller , Bjorn Poonen , Hans Schoutens , Alexandra Shlapentokh

We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…

Logic · Mathematics 2018-02-12 Denis Hirschfeldt , Ken Kramer , Russell Miller , Alexandra Shlapentokh

We introduce the {\em pair-cut cone $PCUT_n$} of metrics on sets with $n\ge 3$ elements, that correspond to linear combinations with non-negative coefficients of the cut-metrics resulting from cuts that are pairs. Given a metric, we fully…

Metric Geometry · Mathematics 2025-12-23 Stanislav Jabuka , Ehsan Mirbagheri

We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…

Logic · Mathematics 2015-07-01 Robert Kenny

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…

Logic in Computer Science · Computer Science 2023-06-22 Eike Neumann , Martin Pape , Thomas Streicher

We define scoring metrics on separable metric spaces and show that they are always no coarser than the metrics from which they spring.

General Topology · Mathematics 2007-05-23 Kerry M. Soileau

A space is reversible if every continuous bijection of the space onto itself is a homeomorphism. In this paper we study the question of which countable spaces with a unique non-isolated point are reversible. By Stone duality, these spaces…

General Topology · Mathematics 2018-09-19 Alan Dow , Rodrigo Hernández-Gutiérrez

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

Computational Complexity · Computer Science 2017-06-30 Jaun Casanova , Simone Santini

In this paper, we prove that the topology induced by algebraic cone metric coincides with the topology induced by the metric obtained via a nonlinear scalarization function, i.e. any algebraic cone metric space is metrizable. Furthermore,…

Functional Analysis · Mathematics 2014-02-04 Saeedeh Shamsi Gamchi , Mohammad Janfada , Assadollah Niknam

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

Logic · Mathematics 2017-01-06 Hakim J. Walker

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

Dynamical Systems · Mathematics 2019-06-06 Silvere Gangloff , Alonso Herrera , Cristobal Rojas , Mathieu Sablik

We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…

Logic · Mathematics 2017-09-29 Matthew Harrison-Trainor

We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…

Logic · Mathematics 2026-01-14 Michał Dybowski , Przemyslaw Górka , Paul Howard

We prove that each non-metrizable sequential rectifiable space $X$ of countable $cs^*$-character contains a clopen rectifiable submetrizable $k_\omega$-subspace $H$ and admits an open disjoint cover by subspaces homeomorphic to clopen…

General Topology · Mathematics 2017-07-11 Taras Banakh , Dusan Repovs

Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…

History and Philosophy of Physics · Physics 2026-05-06 Isaac Pérez Castillo

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

Logic · Mathematics 2023-04-07 I. Sh. Kalimullin