Related papers: Computability of Separation Axioms in Countable Se…
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…
We develop a unified framework for locating natural properties of algebraic and analytic structures within the Borel hierarchy. Objects are presented as quotients of a universal generator and definability is read directly from the quotient…
A dual pair formulation for asymmetric locally convex spaces is developed that strictly generalises the ordinary vector space setting. The concept of a polar topology carries over to the asymmetric case and some familiar results are…
For a Tychonoff space $X$, we denote by $C_k(X)$ the space of all real-valued continuous functions on X with the compact-open topology. In this paper, we have gave characterization for $C_k(X)$ to satisfy $S_{fin}(S, S)$.
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e.…
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…
We use countable metric spaces to code Polish metric spaces and evaluate the complexity of some statements about these codes and of some relations that can be determined by the codes. Also, we propose a coding for continuous functions…
Given a Tychonoff space $X$, let $F(X)$ and $A(X)$ be respectively the free topological group and the free Abelian topological group over $X$ in the sense of Markov. In this paper, we consider two topological properties of $F(X)$ or $A(X)$,…
In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…
If $I$ is an ideal in the ring $C(X)$ of all real valued continuous functions defined over a Tychonoff space $X$, then $X$ is called $I$-$pseudocompact$ if the set $X\setminus \bigcap Z[I]$ is a bounded subset of $X$. Corresponding to $I$,…
We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…
We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
We prove that for each Polish space X, the space C(X) of continuous real-valued functions on X satisfies a strong version of the Pytkeev property, if endowed with the compact-open topology. (This shows that whereas it need not be…
We prove that for any topological space $X$ of countable tightness, each \sigma-convex subspace $\F$ of the space $SC_p(X)$ of scatteredly continuous real-valued functions on $X$ has network weight $nw(\F)\le nw(X)$. This implies that for a…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…