Related papers: A Study on Nice Open Covers in Constructive Analys…
Every beginning real analysis student learns the classic Heine-Borel theorem, that the interval [0,1] is compact. In this article, we present a proof of this result that doesn't involve the standard techniques such as constructing a…
Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…
We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…
By definition, the intersection of finitely many open sets of any topological space is open. Nachbin observed that, more generally, the intersection of compactly many open sets is open. Moreover, Nachbin applied this to obtain elegant…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
We prove that Tietze Extension does not always exist in constructive mathematics if closed sets on which the function we are extending are defined as sequentially closed sets. Firstly, we take a discrete metric space as our topological…
We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…
The main purpose is to establish two theorems about closed 0-definable subsets $A$ of an affine space $K^{n}$ over a Hensel minimal field $K$. The first, being a non-Archimedean counterpart of one from o-minimal geometry, states that every…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…
An open set U of the real numbers R is produced such that the expansion (R,+,x,U) of the real field by U defines a Borel isomorph of (R,+,x,N) but does not define N. It follows that (R,+,x,U) defines sets in every level of the projective…
An important theorem of geometric measure theory (first proved by Besicovitch and Davies for Euclidean space) says that every analytic set of non-zero $s$-dimensional Hausdorff measure $\mathcal H^s$ contains a closed subset of non-zero…
A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…
The regular open subsets of a topological space form a Boolean algebra, where the `join' of two regular open sets is the interior of the closure of their union. A `credence' is a finitely additive probability measure on this Boolean…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
We study some variations of the product topology on families of clopen subsets of $2^{\mathbb{N}}\times\mathbb{N}$ in order to construct countable nodec regular spaces (i.e. in which every nowhere dense set is closed) with analytic topology…
The Heine-Borel theorem for uncountable coverings has recently emerged as an interesting and central principle in higher-order Reverse Mathematics and computability theory, formulated as follows: HBU is the Heine-Borel theorem for…
The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…
Let $U$ be an open relatively compact subanalytic subset of a real analytic manifold. We show that there exists a finite linear covering (in the sense of Guillermou and Schapira) of $U$ by subanalytic open subsets of $U$ homeomorphic to a…
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…