Denis R. Hirschfeldt
Affiliations: University of Chicago, IL, USA
According to our database^{1},
Denis R. Hirschfeldt
authored at least 43 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on andrej.com
On csauthors.net:
Bibliography
2024
Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics.
J. Math. Log., August, 2024
2022
J. Math. Log., 2022
2020
J. Symb. Log., 2020
Comput., 2020
Comput., 2020
Comput., 2020
2019
Comput., 2019
Comput., 2019
Commun. ACM, 2019
2018
Theory Comput. Syst., 2018
2017
Proceedings of the Computability and Complexity, 2017
2016
J. Symb. Log., 2016
J. Math. Log., 2016
Comput., 2016
Five papers on reverse mathematics and Ramseytheoretic principles  C. T. Chong, Theodore A. Slaman, and Yue Yang, The metamathematics of Stable Ramsey's Theorem for Pairs. Journal of the American Mathematical Society, vol. 27 (2014), no. 3, pp. 863892.  Manuel Lerman, Reed Solomon, and Henry Towsner, Separating principles below Ramsey's Theorem for Pairs. Journal of Mathematical Logic, vol. 13 (2013), no. 2, 1350007, 44 pp.  Jiayi Liu, $RT_2^^2$ does not imply WKL 0. Journal of Symbolic Logic, vol. 77 (2012), no. 2, pp. 609620.  Lu Liu, Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 16091630.  Wei Wang, Some logically weak Ramseyan theorems. Advances in Mathematics, vol. 261 (2014), pp. 125.
Bull. Symb. Log., 2016
2015
J. Log. Comput., 2015
2014
Slicing the Truth  On the Computable and Reverse Mathematics of Combinatorial Principles.
Lecture Notes Series / Institute for Mathematical Sciences / National University of Singapore 28, World Scientific, ISBN: 9789814612616, 2014
2012
Comput., 2012
2010
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010
Theory and Applications of Computability, Springer, ISBN: 9780387955674, 2010
2007
Notre Dame J. Formal Log., 2007
J. Symb. Log., 2007
J. Symb. Log., 2007
J. Symb. Log., 2007
J. Comput. Syst. Sci., 2007
2006
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.
Notre Dame J. Formal Log., 2006
J. Symb. Log., 2006
Bull. Symb. Log., 2006
2005
J. Math. Log., 2005
Proceedings of the New Computational Paradigms, 2005
2004
J. Symb. Log., 2004
J. Comput. Syst. Sci., 2004
2003
A computably categorical structure whose expansion by a constant has infinite computable dimension.
J. Symb. Log., 2003
2002
SIAM J. Comput., 2002
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.
Notre Dame J. Formal Log., 2002
Degree Spectra of Relations on Computable Structures in The Presence of delta<sup>0</sup><sub>2</sub> Isomorphisms.
J. Symb. Log., 2002
Proceedings of the Computability and Complexity in Analysis, 2002
Ann. Pure Appl. Log., 2002
Ann. Pure Appl. Log., 2002
2001
J. Symb. Log., 2001
A delta<sup>0</sup><sub>2</sub> Set with No Infinite Low Subset in Either It or Its Complement.
J. Symb. Log., 2001
2000
Bull. Symb. Log., 2000
Ann. Pure Appl. Log., 2000