- Separating principles below Ramsey's theorem for pairs.Manuel Lerman, Reed Solomon & Henry Towsner - 2013 - Journal of Mathematical Logic 13 (2):1350007.details
|
|
Classifying model-theoretic properties.Chris J. Conidis - 2008 - Journal of Symbolic Logic 73 (3):885-905.details
|
|
Combinatorial principles weaker than Ramsey's Theorem for pairs.Denis R. Hirschfeldt & Richard A. Shore - 2007 - Journal of Symbolic Logic 72 (1):171-206.details
|
|
Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..details
|
|
Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.details
|
|
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.details
|
|
On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.details
|
|
(1 other version)A $\delta^0_2$ Set With No Infinite Low Subset In Either It Or Its Complement.Rod Downey, Denis Hirschfeldt, Steffen Lempp & Reed Solomon - 2001 - Journal of Symbolic Logic 66 (3):1371-1381.details
|
|
The Thin Set Theorem for Pairs Implies DNR.Brian Rice - 2015 - Notre Dame Journal of Formal Logic 56 (4):595-601.details
|
|
The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.details
|
|
Reverse mathematics and a Ramsey-type König's Lemma.Stephen Flood - 2012 - Journal of Symbolic Logic 77 (4):1272-1280.details
|
|
(1 other version)Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Mathematical Logic Quarterly 12 (1):295-310.details
|
|
Random reals, the rainbow Ramsey theorem, and arithmetic conservation.Chris J. Conidis & Theodore A. Slaman - 2013 - Journal of Symbolic Logic 78 (1):195-206.details
|
|
Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.details
|
|
Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.details
|
|
Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.details
|
|
The strength of infinitary Ramseyan principles can be accessed by their densities.Andrey Bovykin & Andreas Weiermann - 2017 - Annals of Pure and Applied Logic 168 (9):1700-1709.details
|
|
(1 other version)A Δ20 set with no infinite low subset in either it or its complement.Rod Downey, Denis R. Hirschfeldt, Steffen Lempp & Reed Solomon - 2001 - Journal of Symbolic Logic 66 (3):1371-1381.details
|
|
(1 other version)[Omnibus Review].Carl Jockusch - 1990 - Journal of Symbolic Logic 55 (1):358-360.details
|
|