The following pages link to Damir D. Dzhafarov (Q375887):
Displaying 38 items.
- On the strength of the finite intersection principle (Q375889) (← links)
- Reverse mathematics and properties of finite character (Q435197) (← links)
- Genericity for Mathias forcing over general Turing ideals (Q503254) (← links)
- Stable Ramsey's theorem and measure (Q628806) (← links)
- Infinite saturated orders (Q634735) (← links)
- The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli (Q654397) (← links)
- Ramsey's theorem for trees: the polarized tree theorem and notions of stability (Q964459) (← links)
- \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination (Q976541) (← links)
- The polarized Ramsey's theorem (Q1014283) (← links)
- The complexity of primes in computable unique factorization domains (Q1750293) (← links)
- (Q2075272) (redirect page) (← links)
- Effectiveness for the dual Ramsey theorem (Q2075273) (← links)
- Joins in the strong Weihrauch degrees (Q2331769) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- Generics for computable Mathias forcing (Q2453068) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- On Mathias Generic Sets (Q2904402) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Effectiveness of Hindman’s Theorem for Bounded Sums (Q2970955) (← links)
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES (Q2976339) (← links)
- Definitions of finiteness based on order properties (Q3375515) (← links)
- Ramsey's theorem and cone avoidance (Q3630579) (← links)
- Computably Enumerable Partial Orders (Q4904461) (← links)
- COH, SRT 2 2 , and multiple functionals (Q4995606) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- Reverse Mathematics (Q5095937) (← links)
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH (Q5107225) (← links)
- Ramsey’s theorem and products in the Weihrauch degrees (Q5131643) (← links)
- Some results concerning the SRT 2 2 vs. COH problem (Q5131650) (← links)
- The reverse mathematics of Hindman’s Theorem for sums of exactly two elements (Q5211065) (← links)
- Notions of robust information coding (Q5283443) (← links)
- Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. (Q5283454) (← links)
- A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES (Q5381030) (← links)
- Cohesive avoidance and strong reductions (Q5496327) (← links)
- Limits to joining with generics and randoms (Q5737985) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
