5 research outputs found
Searching for an analogue of ATR in the Weihrauch lattice
There are close similarities between the Weihrauch lattice and the zoo of
axiom systems in reverse mathematics. Following these similarities has often
allowed researchers to translate results from one setting to the other.
However, amongst the big five axiom systems from reverse mathematics, so far
ATR_0 has no identified counterpart in the Weihrauch degrees. We explore and
evaluate several candidates, and conclude that the situation is complicated
An update on Weihrauch complexity, and some open questions
This is an informal survey of progress in Weihrauch complexity (cf
arXiv:1707.03202) in the period 2018-2020. Open questions are emphasised.Comment: Extended abstract for invited talk at CCA 2020
(http://cca-net.de/cca2020/
Some computability-theoretic reductions between principles around
We study the computational content of various theorems with reverse
mathematical strength around Arithmetical Transfinite Recursion
() from the point of view of computability-theoretic
reducibilities, in particular Weihrauch reducibility. Our first main result
states that it is equally hard to construct an embedding between two given
well-orderings, as it is to construct a Turing jump hierarchy on a given
well-ordering. This answers a question of Marcone. We obtain a similar result
for Fra\"iss\'e's conjecture restricted to well-orderings. We then turn our
attention to K\"onig's duality theorem, which generalizes K\"onig's theorem
about matchings and covers to infinite bipartite graphs. Our second main result
shows that the problem of constructing a K\"onig cover of a given bipartite
graph is roughly as hard as the following "two-sided" version of the
aforementioned jump hierarchy problem: given a linear ordering , construct
either a jump hierarchy on (which may be a pseudohierarchy), or an infinite
-descending sequence. We also obtain several results relating the above
problems with choice on Baire space (choosing a path on a given ill-founded
tree) and unique choice on Baire space (given a tree with a unique path,
produce said path)
Overt choice
We introduce and study the notion of overt choice for countably-based spaces
and for CoPolish spaces. Overt choice is the task of producing a point in a
closed set specified by what open sets intersect it. We show that the question
of whether overt choice is continuous for a given space is related to
topological completeness notions such as the Choquet-property; and to whether
variants of Michael's selection theorem hold for that space. For spaces where
overt choice is discontinuous it is interesting to explore the resulting
Weihrauch degrees, which in turn are related to whether or not the space is
Frechet-Urysohn
The computational strength of matchings in countable graphs
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 number of natural variants of these theorems are equivalent, or
closely related, to the ``big five'' subsystems of reverse mathematics.
The results of this paper explore the relationship between graph theory and
logic by showing the way in which specific changes to a single graph-theoretic
principle impact the corresponding proof-theoretical strength. Taken together,
the results and questions of this paper suggest that the existence of matchings
in countable graphs provides a rich context for understanding reverse
mathematics more broadly.Comment: 38 pages, 5 figure