• Publications
• Influence
On uniform relationships between combinatorial problems
• Mathematics
• 1 December 2012
The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic. In this setting, called reverse mathematics, one investigates whichExpand
The polarized Ramsey’s theorem
• Mathematics, Computer Science
• Arch. Math. Log.
• 1 April 2009
This investigation yields a new characterization of Ramsey's theorem in all exponents, and produces several combinatorial principles which, modulo bounding for $$Sigma^0_2}$$ formulas, lie (possibly not strictly) between Ramsey’s theorem for pairs and the stable Ramsey�'s theorem for pair. Expand
Combinatorics and graph theory
• Mathematics
• 2000
Graph Theory: Introductory Concepts.- Trees.- Planarity.- Colorings.- Matchings.- Ramsey Theory.- References Combinatorics: Three Basic Problems.- Binomial Coefficients.- The Principle of InclusionExpand
Weak Comparability of Well Orderings and Reverse Mathematics
• Mathematics, Computer Science
• Ann. Pure Appl. Log.
• 18 April 1990
The main goal of this paper is to give a detailed exposition of this result that any two countable well orderings are weakly comparable if there is an order preserving injection of one into the other. Expand
Reverse Mathematics and Ordinal Exponentiation
• J. Hirst
• Mathematics, Computer Science
• Ann. Pure Appl. Log.
• 10 February 1994
This paper provides empirical support for Simpson's claim that "ATRo is the weakest set of axioms which permits the development of a decent theory of countable ordinals" and analyzes the provability of statements about countable well­ orderings within weak subsystems of second-order arithmetic. Expand
Combinatorics and Graph Theory, Second Edition
• Computer Science
If a $\Pi^1_2$ sentence of a certain form is provable using E-HA${}^\omega$ along with the axiom of choice and an independence of premise principle, the sequential form of the statement is Provable in the classical system RCA. Expand