Damir D. Dzhafarov

Orcid: 0000-0003-4921-7561

According to our database1, Damir D. Dzhafarov authored at least 30 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the first-order parts of problems in the Weihrauch degrees.
Comput., 2024

2022
Reduction games, provability and compactness.
J. Math. Log., 2022

Reverse Mathematics - In cooperation with the association Computability in Europe
Springer, ISBN: 978-3-031-11366-6, 2022

2021
Effectiveness for the Dual Ramsey Theorem.
Notre Dame J. Formal Log., 2021

COH, SRT22, and multiple functionals.
Comput., 2021

2020
The determined Property of Baire in Reverse Math.
J. Symb. Log., 2020

Ramsey's theorem and products in the Weihrauch degrees.
Comput., 2020

Some results concerning the SRT22 vs. COH problem.
Comput., 2020

Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018.
Comput., 2020

2019
A note on the Reverse Mathematics of the Sorites.
Rev. Symb. Log., 2019

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

2018
The Complexity of Primes in Computable Unique Factorization Domains.
Notre Dame J. Formal Log., 2018

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

2017
Joins in the strong Weihrauch degrees.
CoRR, 2017

Notions of robust information coding.
Comput., 2017

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

The uniform content of partial and linear orders.
Ann. Pure Appl. Log., 2017

Effectiveness of Hindman's Theorem for Bounded Sums.
Proceedings of the Computability and Complexity, 2017

2016
Strong Reductions between Combinatorial Principles.
J. Symb. Log., 2016

2015
Classificatory Sorites, Probabilistic Supervenience, and Rule-Making.
CoRR, 2015

2014
Generics for computable Mathias forcing.
Ann. Pure Appl. Log., 2014

2012
Computably Enumerable Partial Orders.
Comput., 2012

Reverse mathematics and properties of finite character.
Ann. Pure Appl. Log., 2012

On Mathias Generic Sets.
Proceedings of the How the World Computes, 2012

2011
Infinite Saturated Orders.
Order, 2011

Stable Ramsey's Theorem and Measure.
Notre Dame J. Formal Log., 2011

2010
Π<sup>0</sup><sub>1</sub> Classes, Peano Arithmetic, Randomness, and Computable Domination.
Notre Dame J. Formal Log., 2010

Ramsey's theorem for trees: the polarized tree theorem and notions of stability.
Arch. Math. Log., 2010

2009
Ramsey's theorem and cone avoidance.
J. Symb. Log., 2009

The polarized Ramsey's theorem.
Arch. Math. Log., 2009


  Loading...