Related papers: The Brouwer invariance theorems in reverse mathema…
We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood, we say that a…
The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…
The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…
Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics where the aim is to identify the minimal axioms needed to prove a given theorem from ordinary, i.e. non-set theoretic, mathematics. This program has unveiled…
We prove that if $(M,\mathcal{X})$ and $(M,\mathcal{Y})$ are countable models of the theory $\mathrm{WKL}^*_0$ such that $\mathrm{I}\Sigma_1(A)$ fails for some $A \in \mathcal{X} \cap \mathcal{Y}$, then $(M,\mathcal{X})$ and…
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.
A cumbersome operation in numerical analysis and linear algebra, optimization, machine learning and engineering algorithms; is inverting large full-rank matrices which appears in various processes and applications. This has both numerical…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We first establish a general random Sperner lemma by presenting a completely new approach for the theory of $L^{0}$-simplicial subdivisions of $L^{0}$-simplexes. Based on this, we are able to achieve a new complete proof of the random…
The inverse theory for Gowers uniformity norms is one of the central topics in additive combinatorics and one of the most important aspects of the theory is the question of bounds. In this paper, we prove a quasipolynomial inverse theorem…
The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…
In this paper we introduce two new generalized variational inequalities, and we give some existence results of the solutions for these variational inequalities involving operators belonging to a recently introduced class of operators. We…
It is investigated in what sense the Brouwer fixed point theorem may be viewed as a corollary of the Lawvere fixed point theorem. A suitable generalisation of the Lawvere fixed point theorem is found and a means is identified by which the…
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,…
In this paper, we study weak approximation with Brauer--Manin obstruction with respect to extensions of number fields. For any nontrivial extension $L/K,$ assuming a conjecture of M. Stoll, we prove that there exists a $K$-threefold…
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…
Oriented cohomology theories provide a general framework to perform intersection-theory-type calculus. The Chow ring, algebraic $K$-theory, and Levine--Morel's algebraic cobordism are all instances of such theories satisfying $\mathbb…
This paper considers the inversion of ill-posed linear operators. To regularise the problem the solution is enforced to lie in a non-convex subset. Theoretical properties for the stable inversion are derived and an iterative algorithm akin…
This work belongs to the framework of inverse problems with linear model. The resolution of this type of problem consists in minimizing (possibly under constraints) a function of discrepancy between the measurements and a physical model of…
We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity is defined in terms of joining virtual link diagrams, which…