We explore the connections between Dickson’s lemma and weak Ramsey theory. We show that a weak version of the Paris–Harrington principle for pairs in c colors and miniaturized Dickson’s lemma for c-tuples are equivalent over \. Furthermore, we look at a cascade of consequences for several variants of weak Ramsey’s theorem.

We show that a miniaturised version of Maclagan's theorem on monomial ideals is equivalent to and classify a phase transition threshold for this theorem. This work highlights the combinatorial nature of Maclagan's theorem.

We classify a sharp phase transition threshold for Friedman’s finite adjacent Ramsey theorem. We extend the method for showing this result to two previous classifications involving Ramsey theorem variants: the Paris–Harrington theorem and the Kanamori–McAloon theorem. We also provide tools to remove ad hoc arguments from the proofs of phase transition results as much as currently possible.

We show that the well partial orderedness of the finite downwards closed subsets of, ordered by inclusion, is equivalent to the well foundedness of the ordinal. Since we use Friedman's adjacent Ramsey theorem for fixed dimensions in the upper bound, we also give a treatment of the reverse mathematical status of that theorem.