Scholarly Contributions
66 Scholarly Contributions
Weihrauch reducibility and Ramsey theorems
Research Type: Poster/Presentation
Weakly cop-win graphs and dominating orders
Research Type: Poster/Presentation
Turing degrees of orders on torsion free abelian groups
Research Type: Poster/Presentation
The uniform content of partial and linear orders
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
The uniform content of ADS
Damir Dzhafarov,
, (2016). The uniform content of ADS, 2016 North American Annual Meeting of the Association for Symbolic Logic, North America
Research Type: Poster/Presentation
The reverse mathematics of Hindman's theorem for sums of exactly two elements.
Damir Dzhafarov,
, (2020). The reverse mathematics of Hindman's theorem for sums of exactly two elements., Computability
Research Type: Journal Article
The random graph
Research Type: Poster/Presentation
The determined property of Baire in reverse math
Damir Dzhafarov
, (2020). The determined property of Baire in reverse math, Journal of Symbolic Logic
Research Type: Journal Article
The complexity of central terms in computable nilpotent groups
Research Type: Journal Article
Strong computable reductions and Ramsey's Theorem
Research Type: Poster/Presentation
Strong computable reducibility and versions of Ramsey's Theorem
Research Type: Poster/Presentation
Stability in reverse mathematics and computable reductions
Research Type: Poster/Presentation
Set theory, orders of infinity and the independence of the Continuum Hypothesis
Research Type: Poster/Presentation
Separating principles below Ramsey's Theorem for Pairs
Research Type: Journal Article
Separating CAC and ADS in reverse mathematics
Research Type: Poster/Presentation
Roots of polynomials in fields of generalized power series
Research Type: Conference Proceedings
Revisiting Remmel's analysis of computable categoricity for linear orders
Research Type: Poster/Presentation
Revisiting EM and ADS
Research Type: Poster/Presentation
Reverse mathematics: An introduction
Research Type: Poster/Presentation
Reverse mathematics, effectiveness and the Dual Ramsey theorem
Research Type: Poster/Presentation
Reverse mathematics and infinite traceable graphs
Research Type: Journal Article
Reverse mathematics and combinatorics
Research Type: Poster/Presentation
Reverse math and the Dual Ramsey Theorem
Research Type: Poster/Presentation
Relatively decidable theories
Research Type: Poster/Presentation
Ramsey’s theorem for singletons and strong computable reducibility
Damir Dzhafarov,
, (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
Ramsey's Theorem and infinite traceable graphs
Research Type: Poster/Presentation
Ramsey theory and regularity properties
Research Type: Poster/Presentation
Ramsey style theorems and subsystems of second order arithmetic
Research Type: Poster/Presentation
RT^1_k, SRT^2_l and sc-reducibility
Research Type: Poster/Presentation
Preparing for graduate school
Research Type: Poster/Presentation
Partial results on the complexity of roots of polynomials over Hahn fields and Puiseux fields
Research Type: Poster/Presentation
Ordering free products in reverse mathematics
Research Type: Conference Proceedings
Ordered abelian groups, generalized series and integer parts
Research Type: Poster/Presentation
Ordered abelian groups and Hahn's theorem
Research Type: Poster/Presentation
On the effectiveness of symmetry breaking
Research Type: Conference Proceedings
Nonstandard analysis
Research Type: Poster/Presentation
Model completeness and relative decidability of countable structures
Research Type: Poster/Presentation
Minimal wit-degrees cannot have c.e. Turing degree
Research Type: Poster/Presentation
Minimal truth table degrees and computably enumerable Turing degrees
Research Type: Journal Article
Lowness notions, measure and domination
Research Type: Journal Article
Low for isomorphism degrees, exact pairs and computable traceability
Research Type: Poster/Presentation
Low for isomorphism degrees
Research Type: Journal Article
Logic and the random graph
Research Type: Poster/Presentation
Local computability for ordinals
Research Type: Conference Proceedings
Jump degrees of torsion free abelian groups
Research Type: Journal Article
Jump degrees for torsion free abelian groups
Research Type: Poster/Presentation
Introduction to Ramsey Theory
Research Type: Poster/Presentation
Hilbert's First Problem
Research Type: Poster/Presentation
Finding order in randomness: Ramsey style regularity theorems
Research Type: Poster/Presentation
Examples of low for isomorphism degrees
Research Type: Poster/Presentation
Enhanced catalysis by activesite mutagenesis at aspartic acid 153 in Escherichia coli alkaline phosphatase
Research Type: Conference Proceedings
Effectiveness of Hindman’s theorem for bounded sums
Damir Dzhafarov
, (2017). Effectiveness of Hindman’s theorem for bounded sums, Proceedings of the International Symposium on Computability and Complexity (in honour of Rod Downey’s 60th birthday), Springer
Research Type: Book Chapter
Effectiveness aspects of Hindman's Theorem
Research Type: Poster/Presentation
Effectiveness and the Dual Ramsey Theorem
Research Type: Poster/Presentation
Degrees which are low for isomorphism
Research Type: Journal Article
Degrees of orders on torsion free abelian groups
Research Type: Journal Article
Degree structures and computational complexity
Research Type: Poster/Presentation
Defining functions by transfinite recursion
Research Type: Poster/Presentation
Counterexamples in Reverse Mathematics Using Iterated Forcing
Research Type: Poster/Presentation
Computable traceability, exact pairs and lowness for isomorphism
Research Type: Poster/Presentation
Computable reductions and reverse mathematics
Research Type: Conference Proceedings
Computable ordered abelian groups and generalized series
Research Type: Poster/Presentation
Computability, randomness and generosity
Research Type: Poster/Presentation
Computability in Cantor Space and in Orderings of Abelian Groups
Research Type: Poster/Presentation
Cappable CEA sets and Ramsey's Theorem
Research Type: Conference Proceedings
Baire codes for Borel sets in reverse mathematics
Research Type: Poster/Presentation