default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamir D. Dzhafarov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Damir D. Dzhafarov
, Reed Solomon, Keita Yokoyama:
On the first-order parts of problems in the Weihrauch degrees. Comput. 13(3-4): 363-375 (2024)- 2022
- [b1]Damir D. Dzhafarov, Carl Mummert:
Reverse Mathematics - In cooperation with the association Computability in Europe. Springer 2022, ISBN 978-3-031-11366-6, pp. 1-457 - [j23]Damir D. Dzhafarov, Denis R. Hirschfeldt, Sarah Reitzes:
Reduction games, provability and compactness. J. Math. Log. 22(3): 2250009:1-2250009:37 (2022) - 2021
- [j22]Damir D. Dzhafarov, Ludovic Patey:
COH, SRT22, and multiple functionals. Comput. 10(2): 111-121 (2021) - [j21]Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick:
Effectiveness for the Dual Ramsey Theorem. Notre Dame J. Formal Log. 62(3) (2021) - 2020
- [j20]Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt, Ludovic Patey, Arno Pauly:
Ramsey's theorem and products in the Weihrauch degrees. Comput. 9(2): 85-110 (2020) - [j19]Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018. Comput. 9(3-4): 167-168 (2020) - [j18]Peter A. Cholak, Damir D. Dzhafarov, Denis R. Hirschfeldt, Ludovic Patey:
Some results concerning the SRT22 vs. COH problem. Comput. 9(3-4): 193-217 (2020) - [j17]Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick:
The determined Property of Baire in Reverse Math. J. Symb. Log. 85(1): 166-198 (2020)
2010 – 2019
- 2019
- [j16]Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019) - [j15]Damir D. Dzhafarov:
A note on the Reverse Mathematics of the Sorites. Rev. Symb. Log. 12(1): 30-36 (2019) - 2018
- [j14]Damir D. Dzhafarov, Joseph R. Mileti:
The Complexity of Primes in Computable Unique Factorization Domains. Notre Dame J. Formal Log. 59(2): 139-156 (2018) - [i3]Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). Dagstuhl Reports 8(9): 1-28 (2018) - 2017
- [j13]Eric P. Astor, Damir D. Dzhafarov, Reed Solomon, Jacob Suggs:
The uniform content of partial and linear orders. Ann. Pure Appl. Log. 168(6): 1153-1171 (2017) - [j12]Damir D. Dzhafarov:
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. Bull. Symb. Log. 23(1): 113-115 (2017) - [j11]Damir D. Dzhafarov, Gregory Igusa:
Notions of robust information coding. Comput. 6(2): 105-124 (2017) - [c2]Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity 2017: 134-142 - [i2]Damir D. Dzhafarov:
Joins in the strong Weihrauch degrees. CoRR abs/1704.01494 (2017) - 2016
- [j10]Damir D. Dzhafarov:
Strong Reductions between Combinatorial Principles. J. Symb. Log. 81(4): 1405-1431 (2016) - 2015
- [i1]Damir D. Dzhafarov, Ehtibar N. Dzhafarov:
Classificatory Sorites, Probabilistic Supervenience, and Rule-Making. CoRR abs/1502.01075 (2015) - 2014
- [j9]Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman:
Generics for computable Mathias forcing. Ann. Pure Appl. Log. 165(9): 1418-1428 (2014) - 2012
- [j8]Damir D. Dzhafarov, Carl Mummert:
Reverse mathematics and properties of finite character. Ann. Pure Appl. Log. 163(9): 1243-1251 (2012) - [j7]Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore:
Computably Enumerable Partial Orders. Comput. 1(2): 99-107 (2012) - [c1]Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst:
On Mathias Generic Sets. CiE 2012: 129-138 - 2011
- [j6]Damir D. Dzhafarov:
Stable Ramsey's Theorem and Measure. Notre Dame J. Formal Log. 52(1): 95-112 (2011) - [j5]Damir D. Dzhafarov:
Infinite Saturated Orders. Order 28(2): 163-172 (2011) - 2010
- [j4]Damir D. Dzhafarov, Jeffry L. Hirst, Tamara J. Lakins:
Ramsey's theorem for trees: the polarized tree theorem and notions of stability. Arch. Math. Log. 49(3): 399-415 (2010) - [j3]David Diamondstone, Damir D. Dzhafarov, Robert I. Soare:
Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination. Notre Dame J. Formal Log. 51(1): 127-159 (2010)
2000 – 2009
- 2009
- [j2]Damir D. Dzhafarov, Jeffry L. Hirst:
The polarized Ramsey's theorem. Arch. Math. Log. 48(2): 141-157 (2009) - [j1]Damir D. Dzhafarov, Carl G. Jockusch Jr.:
Ramsey's theorem and cone avoidance. J. Symb. Log. 74(2): 557-578 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
