Damir D. Dzhafarov

According to our database, Damir D. Dzhafarov authored at least 29 papers between 2009 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Reduction games, provability and compactness.

Damir D. Dzhafarov, Denis R. Hirschfeldt, Sarah Reitzes

J. Math. Log., 2022

Reverse Mathematics - In cooperation with the association Computability in Europe

Damir D. Dzhafarov, Carl Mummert

Springer, ISBN: 978-3-031-11366-6, 2022

2021

Effectiveness for the Dual Ramsey Theorem.

Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick

Notre Dame J. Formal Log., 2021

COH, SRT22, and multiple functionals.

Damir D. Dzhafarov, Ludovic Patey

Comput., 2021

2020

The determined Property of Baire in Reverse Math.

Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick

J. Symb. Log., 2020

Ramsey's theorem and products in the Weihrauch degrees.

Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly

Comput., 2020

Some results concerning the SRT22 vs. COH problem.

Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey

Comput., 2020

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018.

Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly

Comput., 2020

2019

A note on the Reverse Mathematics of the Sorites.

Damir D. Dzhafarov

Rev. Symb. Log., 2019

The reverse mathematics of Hindman's Theorem for sums of exactly two elements.

Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick

Comput., 2019

2018

The Complexity of Primes in Computable Unique Factorization Domains.

Damir D. Dzhafarov, Joseph R. Mileti

Notre Dame J. Formal Log., 2018

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361).

Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly

Dagstuhl Reports, 2018

2017

Joins in the strong Weihrauch degrees.

Damir D. Dzhafarov

CoRR, 2017

Notions of robust information coding.

Damir D. Dzhafarov, Gregory Igusa

Comput., 2017

Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp.

Damir D. Dzhafarov

Bull. Symb. Log., 2017

The uniform content of partial and linear orders.

Eric P. Astor, Damir D. Dzhafarov, Reed Solomon, Jacob Suggs

Ann. Pure Appl. Log., 2017

Effectiveness of Hindman's Theorem for Bounded Sums.

Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick

Proceedings of the Computability and Complexity, 2017

2016

Strong Reductions between Combinatorial Principles.

Damir D. Dzhafarov

J. Symb. Log., 2016

2015

Classificatory Sorites, Probabilistic Supervenience, and Rule-Making.

Damir D. Dzhafarov, Ehtibar N. Dzhafarov

CoRR, 2015

2014

Generics for computable Mathias forcing.

Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman

Ann. Pure Appl. Log., 2014

2012

Computably Enumerable Partial Orders.

Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore

Comput., 2012

Reverse mathematics and properties of finite character.

Damir D. Dzhafarov, Carl Mummert

Ann. Pure Appl. Log., 2012

On Mathias Generic Sets.

Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst

Proceedings of the How the World Computes, 2012

2011

Infinite Saturated Orders.

Damir D. Dzhafarov

Order, 2011

Stable Ramsey's Theorem and Measure.

Damir D. Dzhafarov

Notre Dame J. Formal Log., 2011

2010

Π⁰₁ Classes, Peano Arithmetic, Randomness, and Computable Domination.

David Diamondstone, Damir D. Dzhafarov, Robert I. Soare

Notre Dame J. Formal Log., 2010

Ramsey's theorem for trees: the polarized tree theorem and notions of stability.

Damir D. Dzhafarov, Jeffry L. Hirst, Tamara J. Lakins

Arch. Math. Log., 2010

2009

Ramsey's theorem and cone avoidance.

Damir D. Dzhafarov, Carl G. Jockusch Jr.

J. Symb. Log., 2009

The polarized Ramsey's theorem.

Damir D. Dzhafarov, Jeffry L. Hirst

Arch. Math. Log., 2009