2 citations · 2 across the 1 of their papers we have counts for
4 papers
Effectiveness of Hindman's theorem for bounded sums
Damir D. Dzhafarov, Carl G. Jockusch, Reed Solomon +1
We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified fin…
Asymptotic density and the coarse computability bound
Denis R. Hirschfeldt, Carl G. Jockusch, Timothy H. McNicholl +1
For we say that a set is \emph{coarsely computable at density} if there is a computable set such that has lower density…
Coarse Reducibility and Algorithmic Randomness
Denis R. Hirschfeldt, Carl G. Jockusch, Rutger Kuyper +1
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputabl…
Small forcing creates neither strong nor Woodin cardinals
Joel David Hamkins, W. Hugh Woodin
After small forcing, almost every strongness embedding is the lift of a strongness embedding in the ground model. Consequently, small forcing creates neither strong nor Woodin card…