43 citations · 50 across the 4 of their papers we have counts for
4 papers
On the order dimension of locally countable partial orderings
Kojiro Higuchi, Steffen Lempp, Diip Raghavan +1
We show that the order dimension of the partial order of all finite subsets of under set inclusion is whenever is an infinite cardinal. We also…
On the existence of a strong minimal pair
George Barmpalias, Mingzhong Cai, Steffen Lempp +1
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
Random strings and tt-degrees of Turing complete C.E. sets
Mingzhong Cai, Rodney G Downey, Rachel Epstein +2
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-fr…
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
Denis R. Hirschfeldt, Carl G. Jockusch, Bjørn Kjos-Hanssen +2
We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT im…