scientific article; zbMATH DE number 2236628
From MaRDI portal
Publication:5711879
zbMath1092.03031MaRDI QIDQ5711879
Peter A. Cholak, Jeffry L. Hirst, Mariagnese Giusto, Carl G. jun. Jockusch
Publication date: 8 December 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Second- and higher-order arithmetic and fragments (03F35)
Related Items (19)
On notions of computability-theoretic reduction between Π21 principles ⋮ Partial Orders and Immunity in Reverse Mathematics ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮ Cohesive sets and rainbows ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ The thin set theorem for pairs implies DNR ⋮ Some logically weak Ramseyan theorems ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Combinatorial principles between \(\text{RRT}_2^2\) and \(\text{RT}_2^2\) ⋮ The canonical Ramsey theorem and computability theory ⋮ On uniform relationships between combinatorial problems ⋮ Thin set theorems and cone avoidance ⋮ Pigeons do not jump high ⋮ Constructing sequences one step at a time
This page was built for publication:
