Effectiveness for the dual Ramsey theorem

DOI10.1215/00294527-2021-0024OpenAlexW3207152999MaRDI QIDQ2075273

Linda Brown Westrick, Stephen Flood, D. Reed Solomon, Damir D. Dzhafarov

Publication date: 14 February 2022

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.00070

zbMATH Keywords

reverse mathematicscomputable combinatoricsdual Ramsey theorem

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Generalized Ramsey theory (05C55) 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)

Related Items (5)

Borel combinatorics fail in HYP ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ Carlson-Simpson's lemma and applications in reverse mathematics ⋮ Weak and strong versions of effective transfinite recursion ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectiveness for infinite variable words and the dual Ramsey theorem
• A dual form of Ramsey's theorem
• Computable structures and the hyperarithmetical hierarchy
• STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
• On notions of computability-theoretic reduction between Π21 principles
• On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics
• Introduction to Ramsey Spaces (AM-174)
• Baire Sets of k-Parameter Words are Ramsey
• A computable analysis of variable words theorems
• THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
• Ranked structures and arithmetic transfinite recursion
• Uniformly introreducible sets

This page was built for publication: Effectiveness for the dual Ramsey theorem