Related papers: Update: Remarks on Countable Tightness
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.
The weak tightness $wt(X)$ of a space $X$ was introduced in [11] with the property $wt(X)\leq t(X)$. We investigate several well-known results concerning $t(X)$ and consider whether they extend to the weak tightness setting. First we give…
In this short note we give counterexamples to several results related to extension theorems published recently.
We give a definition of thickness in $\mathbb{R}^d$ that is useful even for totally disconnected sets, and prove a Gap Lemma type result. We also guarantee an interval of distances in any direction in thick compact sets, relate thick sets…
The proof of Lemma 5.1 in the paper Strong $\mathbb A^1$-invariance of $\mathbb A^1$-connected components of reductive algebraic groups (J. Topol. 16 (2023), no. 2, 634--649) is incomplete as it relies on some results of Choudhury-Hagadi,…
This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…
We continue the work of [5] and [3], in which are considered papers in the literature that discuss fixed point assertions in digital topology. We discuss published assertions that are incorrect or incorrectly proven; that are severely…
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…
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
We show how to improve on Theorem 10 in [arXiv:0906.4883], describing when subsets in $W^{1,p}(\mathbb{R}^n)$ are totally bounded subsets of $L^q(\mathbb{R}^n)$ for $p<n$ and $p\le q<p^*$. This improvement was first shown by Dosso, Fofana,…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
The comment gives principal arguments proving that the claims given in the title of the commented paper and some its conclusions have to be wrong for principal reasons. An example illustrating the arguments is provided via atomistic…
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…
We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…
In this paper, we strengthen the splitting theorem proved in [14, 15] and provide a different approach using ideas from the weak KAM theory.
The main purpose of this short note, on the one hand, to is rigorize some part of the proof of Theorem 1.3 in [11] in a simple way, and on the other hand, to give an alternative argument from local inequalities to global ones.
We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.
In the paper it is demonstrated that Bells theorem is an unprovable theorem.
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…