The following pages link to Jeffry L. Hirst (Q335001):
Displayed 50 items.
- A note on the enumeration degrees of 1-generic sets (Q283105) (← links)
- Reverse mathematics, well-quasi-orders, and Noetherian spaces (Q283113) (← links)
- Reverse mathematics and marriage problems with finitely many solutions (Q335003) (← links)
- Program extraction for 2-random reals (Q365682) (← links)
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073) (← links)
- Reverse mathematics and initial intervals (Q386152) (← links)
- Cohesive sets and rainbows (Q386619) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Reverse mathematics and properties of finite character (Q435197) (← links)
- Primitive recursion and the chain antichain principle (Q435242) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- Proper divisibility in computable rings (Q504325) (← links)
- The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
- Reverse mathematics and uniformity in proofs without excluded middle (Q540402) (← links)
- Item:Q335001 (redirect page) (← links)
- Stable Ramsey's theorem and measure (Q628806) (← links)
- Infinite saturated orders (Q634735) (← links)
- The maximal linear extension theorem in second order arithmetic (Q634769) (← links)
- Games with 1-backtracking (Q636360) (← links)
- A measure-theoretic proof of Turing incomparability (Q638476) (← links)
- Hilbert versus Hindman (Q661295) (← links)
- The strong soundness theorem for real closed fields and Hilbert's Nullstellensatz in second order arithmetic (Q701727) (← links)
- Effectiveness for infinite variable words and the dual Ramsey theorem (Q701747) (← links)
- Equivalents of the (weak) fan theorem (Q703836) (← links)
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem (Q714719) (← links)
- Complex analysis in subsystems of second order arithmetic (Q866888) (← links)
- Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
- Weak comparability of well orderings and reverse mathematics (Q918549) (← links)
- Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\) (Q938231) (← links)
- Computable shuffle sums of ordinals (Q938232) (← links)
- Classifying the branching degrees in the Medvedev lattice of \(\Pi^0_1\) classes (Q948754) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- Infinite subsets of random sets of integers (Q1012969) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- Partitions of trees and \({{\text \textsf{ACA}}^\prime_{0}}\) (Q1016503) (← links)
- \({\Pi^1_2}\)-comprehension and the property of Ramsey (Q1016505) (← links)
- Reverse mathematics of prime factorization of ordinals (Q1127837) (← links)
- Reverse mathematics and homeomorphic embeddings (Q1182482) (← links)
- Embeddings of countable closed sets and reverse mathematics (Q1313599) (← links)
- Reverse mathematics and ordinal exponentiation (Q1315456) (← links)
- Infinite versions of some problems from finite complexity theory (Q1374209) (← links)
- A new conservation result of \(\text{WKL}_0\) over \(\text{RCA}_0\) (Q1407524) (← links)
- Vitali's theorem and WWKL (Q1407535) (← links)
- Reverse mathematics and completeness theorems for intuitionistic logic (Q1422103) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures (Q1430995) (← links)
- Reverse mathematics and rank functions for directed graphs (Q1590191) (← links)
- Whitehead's problem and reverse mathematics (Q1618125) (← links)
- On the indecomposability of \(\omega^n\) (Q1762361) (← links)
- Group theoretic properties of the group of computable automorphisms of a countable dense linear order (Q1810808) (← links)