J. Hirst

activity

19942023

most citedReverse mathematics and uniformity in proofs without excluded middle

18 citations · 34 across the 12 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

math.LO2014★ 11 cited

On the existence of a connected component of a graph

Kirill Gura, Jeffry L. Hirst, Carl Mummert

We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is…

math.LO2014

Comparing the strength of diagonally non-recursive functions in the absence of $Σ_{2}^{0}$ induction

François G. Dorais, Jeffry L. Hirst, Paul Shafer

We prove that the statement "there is a $k$ such that for every $f$ there is a $k$ -bounded diagonally non-recursive function relative to $f$ " does not imply weak König's lemma over…

On the existence of a connected component of a graph

Comparing the strength of diagonally non-recursive functions in the absence of Σ20​ induction

Comparing the strength of diagonally non-recursive functions in the absence of $Σ_{2}^{0}$ induction