Denis R. Hirschfeldt

Affiliations:
  • University of Chicago, IL, USA


According to our database1, Denis R. Hirschfeldt authored at least 42 papers between 2000 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

2020
A Minimal Pair in the Generic Degrees.
J. Symb. Log., 2020

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

Combinatorial principles equivalent to weak induction.
Comput., 2020

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

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

Dense computability, upper cones, and minimal pairs.
Comput., 2019

Algorithmic randomness.
Commun. ACM, 2019

2018
Preface.
Theory Comput. Syst., 2018

2017
Some Questions in Computable Mathematics.
Proceedings of the Computability and Complexity, 2017

2016
Coarse Reducibility and Algorithmic Randomness.
J. Symb. Log., 2016

On notions of computability-theoretic reduction between Π21 principles.
J. Math. Log., 2016

Asymptotic density and the coarse computability bound.
Comput., 2016

Five papers on reverse mathematics and Ramsey-theoretic 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. 863-892. - 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. 609-620. - Lu Liu, Cone avoiding closed sets. Transactions of the American Mathematical Society, vol. 367 (2015), no. 3, pp. 1609-1630. - Wei Wang, Some logically weak Ramseyan theorems. Advances in Mathematics, vol. 261 (2014), pp. 1-25.
Bull. Symb. Log., 2016

2015
Counting the changes of random Δ20 sets.
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: 978-981-4612-61-6, 2014

2012
Finite Self-Information.
Comput., 2012

2010
Counting the Changes of Random D<sup>0</sup><sub>2</sub> Sets.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Algorithmic Randomness and Complexity.
Theory and Applications of Computability, Springer, ISBN: 978-0-387-95567-4, 2010

2007
Order-Computable Sets.
Notre Dame J. Formal Log., 2007

Combinatorial principles weaker than Ramsey's Theorem for pairs.
J. Symb. Log., 2007

Bounding homogeneous models.
J. Symb. Log., 2007

Π<sub>1</sub><sup>0</sup> classes and strong degree spectra of relations.
J. Symb. Log., 2007

Undecidability of the structure of the Solovay degrees of c.e. reals.
J. Comput. Syst. Sci., 2007

2006
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.
Notre Dame J. Formal Log., 2006

Every 1-generic computes a properly 1-generic.
J. Symb. Log., 2006

Calibrating Randomness.
Bull. Symb. Log., 2006

2005
Relativizing Chaitin's Halting Probability.
J. Math. Log., 2005

Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory.
Proceedings of the New Computational Paradigms, 2005

2004
Bounding prime models.
J. Symb. Log., 2004

Randomness and reducibility.
J. Comput. Syst. Sci., 2004

2003
A computably categorical structure whose expansion by a constant has infinite computable dimension.
J. Symb. Log., 2003

2002
Randomness, Computability, and Density.
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

Trivial Reals.
Proceedings of the Computability and Complexity in Analysis, 2002

Degree spectra and computable dimensions in algebraic structures.
Ann. Pure Appl. Log., 2002

Degree spectra of relations on structures of finite computable dimension.
Ann. Pure Appl. Log., 2002

2001
Degree Spectra of Intrinsically C.E. Relations.
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
Degree spectra of relations on computable structures.
Bull. Symb. Log., 2000

Undecidability and 1-types in intervals of the computably enumerable degrees.
Ann. Pure Appl. Log., 2000


  Loading...