3 citations · 4 across the 5 of their papers we have counts for
11 papers
Finding minimum spanning trees via local improvements
Louigi Addario-Berry, Jordan Barrett, Benoît Corsini
We consider a family of local search algorithms for the minimum-weight spanning tree, indexed by a parameter . One step of the local search corresponds to replacing a connected…
Reverse mathematics of rings
Jordan Mitchell Barrett
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in com…
Cousin's lemma in second-order arithmetic
Jordan Mitchell Barrett, Rodney G. Downey, Noam Greenberg
Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cous…
Elementary topoi
Jordan Mitchell Barrett
As the prototypical category, has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $…
The reverse mathematics of Cousin's lemma
Jordan Mitchell Barrett
Cousin's lemma is a compactness principle that naturally arises when studying the gauge integral, a generalisation of the Lebesgue integral. We study the axiomatic strength of Cous…
On Ramsey-minimal infinite graphs
Jordan Mitchell Barrett, Valentino Vito
For fixed finite graphs , , a common problem in Ramsey theory is to study graphs such that , i.e. every red-blue coloring of the edges of produces either…