The Ginsburg-Sands theorem and computability theory

Foundations of classical theories (including reverse mathematics) (03B30) Ramsey theory (05D10) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
The inductive strength of Ramsey's theorem for pairs
A Ramsey theorem for trees
On the strength of Ramsey's theorem
Reverse mathematics of topology: dimension, paracompactness, and splittings
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
Filters on computable posets
Coloring trees in reverse mathematics
On the strength of Ramsey's theorem for pairs
A Δ₂⁰ set with no infinite low subset in either it or its complement
Turing Computability
RT₂² does not imply WKL₀
THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS
Algorithmic Randomness and Complexity
Reverse Mathematics: The Playground of Logic
The metamathematics of Stable Ramsey’s Theorem for Pairs
Slicing the Truth
Partition Theorems and Computability Theory
Combinatorial principles weaker than Ramsey's Theorem for pairs
On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
Reverse mathematics, computability, and partitions of trees
Ramsey's theorem and cone avoidance
Minimal Infinite Topological Spaces
A Partition Theorem for the Infinite Subtrees of a Tree
Generalized cohesiveness
A cohesive set which is not high
Iterative forcing and hyperimmunity in reverse mathematics
Nets and reverse mathematics
The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
Reduction games, provability and compactness
Reverse Mathematics
The strength of compactness for countable complete linear orders
The weakness of the pigeonhole principle under hyperarithmetical reductions
On the mathematical and foundational significance of the uncountable
SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
A Partition Theorem
∏ 0 1 Classes and Degrees of Theories
Ramsey's theorem and recursion theory
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective

This page was built for publication: The Ginsburg-Sands theorem and computability theory