The following pages link to Jeffry L. Hirst (Q335001):
Displayed 50 items.
- Some conservation results on weak König's lemma (Q1849864) (← links)
- The computably enumerable degrees are locally non-cappable (Q1879005) (← links)
- Reverse mathematics and Peano categoricity (Q1935867) (← links)
- A variant of Mathias forcing that preserves \(\mathsf{ACA}_0\) (Q1938403) (← links)
- Galvin's ``racing pawns'' game, internal hyperarithmetic comprehension, and the law of excluded middle (Q1949169) (← links)
- Things that can and things that cannot be done in PRA (Q1971796) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- Splittings and disjunctions in reverse mathematics (Q2176407) (← links)
- On the strength of Ramsey's theorem for trees (Q2182273) (← links)
- Ring structure theorems and arithmetic comprehension (Q2219093) (← links)
- Completion of choice (Q2220486) (← links)
- The abstract type of the real numbers (Q2238151) (← links)
- Reverse mathematics and marriage problems with unique solutions (Q2257105) (← links)
- Full and hat inductive definitions are equivalent in NBG (Q2257106) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Using Ramsey's theorem once (Q2274133) (← links)
- Connected components of graphs and reverse mathematics (Q2277258) (← links)
- Pincherle's theorem in reverse mathematics and computability theory (Q2304540) (← links)
- Reverse mathematics and colorings of hypergraphs (Q2312088) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Equivalence between Fraïssé's conjecture and Jullien's theorem (Q2368905) (← links)
- Fundamental notions of analysis in subsystems of second-order arithmetic (Q2368910) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Classical consequences of continuous choice principles from intuitionistic analysis (Q2443117) (← links)
- Baire categoricity and \(\Sigma_1^0\)-induction (Q2443120) (← links)
- The distribution of ITRM-recognizable reals (Q2453067) (← links)
- Generics for computable Mathias forcing (Q2453068) (← links)
- Ideals in computable rings (Q2456205) (← links)
- Subspaces of computable vector spaces (Q2456206) (← links)
- Interval orders and reverse mathematics (Q2469435) (← links)
- Reverse mathematics of separably closed sets (Q2580957) (← links)
- On the complexity of radicals in noncommutative rings (Q2655033) (← links)
- Denis R. Hirschfeldt. Slicing the truth: On the computable and reverse mathematics of combinatorial principles. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore, vol. 28. World Scientific Publishing Co. Pte. Ltd., (Q2795310) (← links)
- COMPARING THE STRENGTH OF DIAGONALLY NONRECURSIVE FUNCTIONS IN THE ABSENCE OF INDUCTION (Q2795915) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- On Mathias Generic Sets (Q2904402) (← links)
- Reverse Mathematics of Matroids (Q2970956) (← links)
- More reverse mathematics of the Heine-Borel Theorem (Q3145974) (← links)
- Reverse mathematics, trichotomy, and dichotomy (Q3145982) (← links)
- On the existence of a connected component of a graph (Q3195646) (← links)
- (Q3464620) (← links)
- (Q3478406) (← links)
- (Q3508462) (← links)
- Reverse mathematics, computability, and partitions of trees (Q3616350) (← links)
- (Q3797180) (← links)
- (Q3840692) (← links)
- Reverse Mathematics and Ordinal Multiplication (Q4224079) (← links)
- Reverse Mathematics and Recursive Graph Theory (Q4224080) (← links)
- Ordinal inequalities, transfinite induction, and reverse mathematics (Q4262583) (← links)