11 citations · 35 across the 26 of their papers we have counts for
34 papers
The weakness of typicality
Eric P. Astor, Laurent Bienvenu, Damir Dzhafarov +4
Many statements studied in reverse mathematics can be seen as mathematical problems, formulated in terms of instances and solutions. We develop a framework of typicality encompassi…
Finite combinatorics and computability theory
Damir D. Dzhafarov, Jun le Goh
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reform…
The Ginsburg--Sands theorem and computability theory
Heidi Benham, Andrew De Lapo, Damir Dzhafarov +2
The Ginsburg--Sands theorem from topology states that every infinite topological space has an infinite subspace homeomorphic to exactly one of the following five topologies on :…
The tree pigeonhole principle in the Weihrauch degrees
Damir Dzhafarov, Reed Solomon, Manlio Valenti
We study versions of the tree pigeonhole principle, , in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensi…
On the first-order parts of problems in the Weihrauch degrees
Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama
We introduce the notion of the \emph{first-order part} of a problem in the Weihrauch degrees. Informally, the first-order part of a problem is the strongest problem wi…
Reduction games, provability, and compactness
Damir D. Dzhafarov, Denis R. Hirschfeldt, Sarah C. Reitzes
Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications betwe…