Damir Dzhafarov
Associate Professor/Mathematics

Contact:

Are you Damir Dzhafarov?

How to update your information.
Scholarly Contributions

31 Scholarly Contributions

Journal Article ✕
31
Journal Articles
11
Poster/Presentations
3
Book Chapters
The reverse mathematics of Hindman's theorem for sums of exactly two elements.
Carl Jockusch, Jr., Barbara Csima, Damir Dzhafarov, Linda B Westrick, Denis Hirschfeldt, David R Solomon , (2020). The reverse mathematics of Hindman's theorem for sums of exactly two elements., Computability
Research Type: Journal Article
Ramsey's theorem and products in the Weihrauch degrees
Ludovic Patey, Damir Dzhafarov, Denis Hirschfeldt, Jun Le Goh, Arno Pauly , (2020). Ramsey's theorem and products in the Weihrauch degrees, Computability
Research Type: Journal Article
The determined property of Baire in reverse math
David R Solomon, Antonio Montalban, Linda B Westrick, Eric Astor, Damir Dzhafarov , (2020). The determined property of Baire in reverse math, Journal of Symbolic Logic
Research Type: Journal Article
A note on the reverse mathematics of the sorites
Damir Dzhafarov , (2019). A note on the reverse mathematics of the sorites, Review of Symbolic Logic
Research Type: Journal Article
Joins in the strong Weihrauch degrees
Damir Dzhafarov , (2019). Joins in the strong Weihrauch degrees, Mathematical Research Letters
Research Type: Journal Article
The complexity of primes in computable UFDs
Damir Dzhafarov, Joseph R. Mileti , (2018). The complexity of primes in computable UFDs, Notre Dame J. Formal Logic, vol. 59, pp. 139-156
Research Type: Journal Article
The uniform content of partial and linear orders
David R Solomon, Jacob Daniel Suggs, Eric Astor, Damir Dzhafarov , (2017). The uniform content of partial and linear orders, Ann. Pure Appl. Logic, vol. 168, iss. 6, pp. 1153–1171
Research Type: Journal Article
Notions of robust information coding
Damir Dzhafarov, Gregory Igusa , (2017). Notions of robust information coding, Computability, vol. 6, iss. 2, pp. 105–124,
Research Type: Journal Article
Soare Robert I., Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi 263 pp.
Damir Dzhafarov , (2017). Soare Robert I., Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi 263 pp., The Bulletin of Symbolic Logic, vol. 23, iss. 1, pp. 113–115, Cambridge University Press
Research Type: Journal Article
Ramsey’s theorem for singletons and strong computable reducibility
Linda B Westrick, Damir Dzhafarov, David R Solomon, Ludovic Patey , (2017). Ramsey’s theorem for singletons and strong computable reducibility, Proc. Amer. Math. Soc., vol. 145, iss. 3, pp. 1343–1355
Research Type: Journal Article
Coloring trees in reverse mathematics
Ludovic Patey, Damir Dzhafarov , (2017). Coloring trees in reverse mathematics, Advances in Mathematics, vol. 318, pp. 497–514
Research Type: Journal Article
Genericity for Mathias forcing over general Turing ideals
Peter A. Cholak, Mariya I. Soskova, Damir Dzhafarov , (2016). Genericity for Mathias forcing over general Turing ideals, Israel J. Math., vol. 216, iss. 2, pp. 583–604
Research Type: Journal Article
Strong reductions between combinatorial principles
Damir Dzhafarov , (2016). Strong reductions between combinatorial principles, The Journal of Symbolic Logic, vol. 81, iss. 4, pp. 1405–1431, Cambridge University Press
Research Type: Journal Article
On uniform relationships between combinatorial problems
Paul Shafer, Jeffry L. Hirst, Francois G. Dorais, Damir Dzhafarov, Joseph R. Mileti , (2016). On uniform relationships between combinatorial problems, Trans. Amer. Math. Soc., vol. 368, iss. 2, pp. 1321–1359
Research Type: Journal Article
Cohesive avoidance and strong reductions
Damir Dzhafarov , (2015). Cohesive avoidance and strong reductions, Proc. Amer. Math. Soc., vol. 143, iss. 2, pp. 869–876
Research Type: Journal Article
Generics for computable Mathias forcing
Damir Dzhafarov, Jeffry L. Hirst, Peter A. Cholak, Theodore A. Slaman , (2014). Generics for computable Mathias forcing, Ann. Pure Appl. Logic, vol. 165, iss. 9, pp. 1418–1428
Research Type: Journal Article
On the strength of the finite intersection principle
Damir Dzhafarov, Carl Mummert , (2013). On the strength of the finite intersection principle, Israel J. Math., vol. 196, iss. 1, pp. 345–361
Research Type: Journal Article
Reverse mathematics and properties of finite character
Carl Mummert, Damir Dzhafarov , (2012). Reverse mathematics and properties of finite character, Ann. Pure Appl. Logic, vol. 163, iss. 9, pp. 1243–1251
Research Type: Journal Article
Computably enumerable partial orders.
Richard A. Shore, Peter A. Cholak, Noah Schweber, Damir Dzhafarov , (2012). Computably enumerable partial orders., Computability, vol. 1, iss. 2, pp. 99-107
Research Type: Journal Article
Infinite Saturated Orders
Damir Dzhafarov , (2011). Infinite Saturated Orders, Order, vol. 28, iss. 2, pp. 163–172
Research Type: Journal Article
Stable Ramsey’s theorem and measure
Damir Dzhafarov , (2011). Stable Ramsey’s theorem and measure, Notre Dame J. Form. Log., vol. 52, iss. 1, pp. 95–112
Research Type: Journal Article
The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli
Damir Dzhafarov, Ehtibar N. Dzhafarov , (2011). The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli, J. Math. Psychol., vol. 55, iss. 6, pp. 469-472
Research Type: Journal Article
Sorites Without Vagueness I: Classificatory Sorites
Damir Dzhafarov, Ehtibar N. Dzhafarov , (2010). Sorites Without Vagueness I: Classificatory Sorites, Theoria, vol. 76, iss. 1, pp. 24-Apr
Research Type: Journal Article
Pi^0_1 classes, Peano arithmetic, randomness, and computable domination
Robert I. Soare, David E. Diamondstone, Damir Dzhafarov , (2010). Pi^0_1 classes, Peano arithmetic, randomness, and computable domination, Notre Dame J. Form. Log., vol. 51, iss. 1, pp. 127–159
Research Type: Journal Article
Sorites Without Vagueness II: Comparative Sorites
Damir Dzhafarov, Ehtibar N. Dzhafarov , (2010). Sorites Without Vagueness II: Comparative Sorites, Theoria, vol. 76, iss. 1, pp. 25-53
Research Type: Journal Article
Ramsey’s theorem for trees: the polarized tree theorem and notions of stability
Jeffry L. Hirst, Damir Dzhafarov, Tamara J. Lakins , (2010). Ramsey’s theorem for trees: the polarized tree theorem and notions of stability, Arch. Math. Logic, vol. 49, iss. 3, pp. 399–415
Research Type: Journal Article
Ramsey’s theorem and cone avoidance
Carl G. Jockusch, Jr., Damir Dzhafarov , (2009). Ramsey’s theorem and cone avoidance, J. Symbolic Logic, vol. 74, iss. 2, pp. 557–578
Research Type: Journal Article
The polarized Ramsey’s theorem
Jeffry L. Hirst, Damir Dzhafarov , (2009). The polarized Ramsey’s theorem, Arch. Math. Logic, vol. 48, iss. 2, pp. 141–157
Research Type: Journal Article
Definitions of finiteness based on order properties
Eric J. Hall, Damir Dzhafarov, Omar De la Cruz , (2006). Definitions of finiteness based on order properties, Fund. Math., vol. 189, iss. 2, pp. 155–172
Research Type: Journal Article
COH, SRT^2_2, and multiple functionals
Damir Dzhafarov, Ludovic Patey COH, SRT^2_2, and multiple functionals
Research Type: Journal Article
Some results concerning the SRT^2_2 vs. COH problem
Peter Cholak, Ludovic Patey, Denis Hirschfeldtr, Damir Dzhafarov Some results concerning the SRT^2_2 vs. COH problem, Computability
Research Type: Journal Article