Related papers: Countable Ordered Groups and Weihrauch Reducibilit…
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…
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…
The smooth development of large parts of mathematics hinges on the idea that some sets are `small' or `negligible' and can therefore be ignored for a given purpose. The perhaps most famous smallness notion, namely `measure zero', originated…
We extend the Dong-Mason theorem on the irreducibility of modules for orbifold vertex algebras from [C. Dong, G. Mason, Duke Math. J. 86 (1997)] 305-321] for the category of weak modules. Let $V$ be a vertex operator algebra, $g$ an…
Consider, on the space of marked groups, the map $\mathrm{Res}_{\mathcal{C}}$ which associates to a marked group its greatest residually-$\mathcal{C}$ quotient, for different sets $\mathcal{C}$ of groups. Except for trivial cases, this map…
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…
We study a class of left-invertible operators which we call weakly concave operators. It includes the class of concave operators and some subclasses of expansive strict $m$-isometries with $m > 2$. We prove a Wold-type decomposition for…
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
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…
We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
In arXiv:1811.04649, we extended the Dong-Mason theorem on irreducibility of modules for cyclic orbifold vertex algebras to the entire category weak modules and applied this result to Whittaker modules. In this paper we present further…
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 study metric projections onto cones in the Wasserstein space of probability measures, defined by stochastic orders. Dualities for backward and forward projections are established under general conditions. Dual optimal solutions and their…
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is to provide an alternative classification of theorems based on…
Odifreddi asked whether every non-irreducible many-one degree must contain an infinite antichain of one-one degrees. Positive answers are known for computably enumerable many-one degrees (Degtev) and, more recently, for many-one degrees…
A group is irreducibly represented if it has a faithful irreducible unitary representation. For countable groups, a criterion for irreducible representability is given, which generalises a result obtained for finite groups by W. Gasch\"utz…
Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…