Related papers: Weak K\"{o}nig's lemma implies the uniform continu…

In this paper, we propose a weak regularity principle which is similar to both weak K\"onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then…

We prove conservativity results for weak K\H{o}nig's lemma that extend the celebrated result of Harrington (for $\Pi^1_1$-statements) and are somewhat orthogonal to the extension by Simpson, Tanaka and Yamazaki (for statements of the form…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

Brouwer's fan theorem states that every bar is a uniform bar. We give an overview of the status of this axiom in Bishop's constructive mathematics. In particular, we describe the relationship between the fan theorem, the weak K\"onig lemma,…

It is well-known that any finite $\Pi^{0}_{1}$-class of $2^{\mathbb N}$ has a computable member. Then, how can we understand this in the context of reverse mathematics? In this note, we consider several very weak fragments of K\H{o}nig's…

We propose the notions of uniform local weak o-minimality and $*$-local weak o-minimality. Local monotonicity theorems hold in definably complete locally o-minimal structures and uniformly locally o-minimal structures of the second kind. In…

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 consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

In this note the following version of Phillips' lemma is proved. The L-projection of an L-embedded space - that is of a Banach space which is complemented in its bidual such that the norm between the two complementary subspaces is additive…

We study constructively the relations between the finite cases of Dickson's lemma. Although there are many constructive proofs of them, the novel aspect of our proofs is the extraction of a corresponding bound. We provide some new one-step…

We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…

Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…

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…

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…

We present the universal theory of weak crossed biproducts, and we prove that every weak projection of weak bialgebras induces an example of this crossed structure. As an example, we give the construction of a weak projection of a weak…

We give a simple, elementary proof that a uniform algebra is weakly sequentially complete if and only if it is finite-dimensional.

In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…

Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial…

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…