English
Related papers

Related papers: Reverse mathematics of regular countable second co…

200 papers

We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…

General Topology · Mathematics 2024-03-11 Abhijit Dasgupta

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.…

Logic · Mathematics 2020-02-03 Dag Normann , Sam Sanders

In arXiv:1603.03910 [math.NT] we introduced some $C_{n}$ in $Z/2[t]$ defined by a linear recurrence and showed that each $C_{n}$, $n\equiv 0 \bmod{4}$, is a sum of $C_{k}$, $k<n$. Combining this with results from arXiv:1508.07523 [math.NT]…

Number Theory · Mathematics 2016-12-07 Paul Monsky

Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…

Geometric Topology · Mathematics 2022-03-14 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…

Data Structures and Algorithms · Computer Science 2013-09-25 V. F. Romanov

By reformulating the classical proof as a Baire Category argument, we show that Besicovitch's Theorem in Cantor space is provable in $ACA_0$, and additionally that the witnessing subset is computable from one jump of the original set. We…

Logic · Mathematics 2026-02-03 Emma Gruner , Jan Reimann

Let $X^{(2)}$ denote the second symmetric product space of a partially ordered vector space $X$, endowed with the projective cone. A characterization of linear maps $T\colon X^{(2)}\to X^{(2)}$ which preserve the set of all positive…

Functional Analysis · Mathematics 2026-05-19 Pavankumar Raickwade , K. C. Sivakumar

Compressed sensing (CS) is a sampling theory that allows reconstruction of sparse (or compressible) signals from an incomplete number of measurements, using of a sensing mechanism implemented by an appropriate projection matrix. The CS…

Computer Vision and Pattern Recognition · Computer Science 2017-08-29 Duc Minh Nguyen , Evaggelia Tsiligianni , Nikos Deligiannis

This work continues the study of the relationship between sample compression schemes and statistical learning, which has been mostly investigated within the framework of binary classification. The central theme of this work is establishing…

Machine Learning · Computer Science 2017-01-02 Ofir David , Shay Moran , Amir Yehudayoff

The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…

Logic · Mathematics 2022-08-02 Anton Freund , Patrick Uftring

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

Logic · Mathematics 2014-01-03 Jeremy Avigad , Edward Dean , Jason Rute

The Jordan decomposition theorem states that every function $f \colon [0,1] \to \mathbb{R}$ of bounded variation can be written as the difference of two non-decreasing functions. Combining this fact with a result of Lebesgue, every function…

Logic · Mathematics 2021-01-11 André Nies , Marcus A. Triplett , Keita Yokoyama

We study the first-order consequences of Ramsey's Theorem for $k$-colourings of $n$-tuples, for fixed $n, k \ge 2$, over the relatively weak second-order arithmetic theory $\mathrm{RCA}^*_0$. Using the Chong-Mourad coding lemma, we show…

This paper continues the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. In particular, we consider problems related to perfect subsets of Polish spaces, studying the perfect set…

Logic · Mathematics 2025-07-11 Vittorio Cipriani , Alberto Marcone , Manlio Valenti

We undertake the study of size-change analysis in the context of Reverse Mathematics. In particular, we prove that the SCT criterion is equivalent to $\Sigma^0_2$-induction over RCA$_0$.

Logic · Mathematics 2016-11-17 Emanuele Frittaion , Silvia Steila , Keita Yokoyama

Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cousin's lemma for various classes of functions, using Friedman…

Logic · Mathematics 2020-11-30 Jordan Mitchell Barrett

The author presents a new proof of injectivity of the composition of the inverse of the rational Chern Character in homology applied to the classifying space BG of a (countable) discrete group G, restricted to dimensions less or equal than…

K-Theory and Homology · Mathematics 2012-10-09 Ulrich Haag

In the absence of the Axiom of Choice, necessary and sufficient conditions for a locally compact Hausdorff space to have all non-empty second-countable compact Hausdorff spaces as remainders are given in $\mathbf{ZF}$. Among other…

General Topology · Mathematics 2020-09-22 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

We analyze the axiomatic strength of the following theorem due to Rival and Sands in the style of reverse mathematics. "Every infinite partial order $P$ of finite width contains an infinite chain $C$ such that every element of $P$ is either…

Logic · Mathematics 2024-08-06 Marta Fiori-Carones , Alberto Marcone , Paul Shafer , Giovanni Soldà

Compressed Sensing (CS) is an emerging field that enables reconstruction of a sparse signal $x \in {\mathbb R} ^n$ that has only $k \ll n$ non-zero coefficients from a small number $m \ll n$ of linear projections. The projections are…

Information Theory · Computer Science 2011-03-29 Shriram Sarvotham , Richard G. Baraniuk