David Nichols

most citedStrong Reductions between Relatives of the Stable Ramsey's Theorem

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.LO2017

Effective Completeness for S4.3.1-Theories with Respect to Discrete Linear Models

David Nichols

The computable model theory of modal logic was initiated by Suman Ganguli and Anil Nerode in [4]. They use an effective Henkin-type construction to effectivize various completeness…

math.LO2017★ 2 cited

Strong Reductions between Relatives of the Stable Ramsey's Theorem

David Nichols

A complete analysis is given of the computable reductions that hold between $SRT_{2}^{2}$ , $SPT_{2}^{2}$ , and $SIPT_{2}^{2}$ . In particular, while $\mathsf{D}^2_2\le…