Related papers: Computability of Separation Axioms in Countable Se…

We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification Rosenthal compacta, to identify new complexity classes. We use the language of…

We prove that topological isomorphism on procountable groups is not classifiable by countable structures, in the sense of descriptive set theory. In fact, the equivalence relation $\ell_\infty$ expressing that two sequences of reals have a…

Dimensional types of metric scattered spaces are investigated. Revised proofs of Mazurkiewicz-Sierpi\'nski and Knaster-Urbanik theorems are presented. Embeddable properties of countable metric spaces are generalized onto uncountable metric…

Being motivated by the famous Kaplansky theorem we study various sequential properties of a Banach space $E$ and its closed unit ball $B$, both endowed with the weak topology of $E$. We show that $B$ has the Pytkeev property if and only if…

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

Milnor proved two uniqueness theorems for axiomatic (co)homology: one for pairs of compacta (1960) and another, in particular, for pairs of countable simplicial complexes (1961). We obtain their common generalization: the Eilenberg-Steenrod…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Regularity properties of the pressure are related to phase transitions. In this article we study thermodynamic formalism for systems defined in non-compact phase spaces, our main focus being countable Markov shifts. We produce metric…

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

In spaces of metrics, we investigate topological distributions of the doubling property, the uniform disconnectedness, and the uniform perfectness, which are the quasi-symmetrically invariant properties appearing in the David--Semmes…

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

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…

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

We study tightness properties and selective versions of separability in bitopological function spaces endowed with set-open topologies.

The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…

A topological space is nonseparably connected if it is connected but all of its connected separable subspaces are singletons. We show that each connected first countable space is the image of a nonseparably connected complete metric space…

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of effective quasi-Polish spaces. In particular, we prove an…