Related papers: Taking the path computably travelled

The Baire category theorem states that every complete pseudometric space is a Baire space. There are some results in metric spaces which have their analogue in uniform spaces, however this is not one of them. Nonetheless, since the Baire…

We show that for each countable simplicial complex P the following conditions are equivalent: (1) $P \in AE(X)$ iff $P \in AE(\beta X)$ for any space X; (2) There exists a P-invertible map of a metrizable compactum X with $P \in AE(X)$ onto…

The (parallel linear) transports in tensor spaces generated by derivations of the tensor algebra along paths are axiomatically described. Certain their properties are investigated. Transports along paths defined by derivations of the tensor…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

We establish a connection between two well-studied spaces of countable groups: the space of group operations and the space of marked groups. This connection shows that the two spaces are equivalent in terms of generic properties in the…

Let us denote by $\Phi(\lambda,\mu)$ the statement that $\mathbb{B}(\lambda) = D(\lambda)^\omega$, i.e. the Baire space of weight $\lambda$, has a coloring with $\mu$ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Let $X$ be a topological space. Let $X_0 \subseteq X$ be a second countable subspace. Also, assume that $X$ is first countable at any point of $X_0$. Then we provide some conditions under which we ensure that $X_0$ is not Baire.

By using a similar pattern of arguments, we show that in three categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at…

A topological space $X$ is Baire if the Baire Category Theorem holds for $X$, i.e., the intersection of any sequence of open dense subsets of $X$ is dense in $X$. One of the interesting problems in the theory of functional spaces is the…

Let $M$ be any $n$ dimensional smooth manifold and $PM$ be the space of all smooth paths, then we showed that $PM$ is a smooth manifold modelled over a complete normable space. We discussed many geometric structure on Path spaces and its…

We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurable solution, a factor of iid solution, or a solution with the…

We have previously established that $\Pi^1_1$-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann-Howard fixed point, over $\mathbf{ATR_0}$. In the present paper we show that the base theory can be…

We show that every (invertible, or noninvertible) minimal Cantor system embeds in $\mathbb{R}$ with vanishing derivative everywhere. We also study relations between local shrinking and periodic points.

Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

Topological complexity for spaces was introduced by M. Farber as a minimal number of continuity domains for motion planning algorithms. It turns out that this notion can be extended to the case of not necessarily commutative C*-algebras.…

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…