2 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
Cohesive avoidance and arithmetical sets
Damir D. Dzhafarov
An open question in reverse mathematics is whether the cohesive principle, $\COH$, is implied by the stable form of Ramsey's theorem for pairs, $\SRT^2_2$, in -models of $\RCA$.…
Limits to joining with generics and randoms
Adam R. Day, Damir D. Dzhafarov
Posner and Robinson (1981) proved that if is non-computable, then there exists a such that . Shore and Slaman (1999) extended…
Stable Ramsey's theorem and measure
Damir D. Dzhafarov
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all s…
Infinite saturated orders
Damir D. Dzhafarov
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theor…
Reverse mathematics and equivalents of the axiom of choice
Damir D. Dzhafarov, Carl Mummert
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle ass…