Thin set theorems and cone avoidance

DOI10.1090/tran/7987zbMath1442.03007arXiv1812.00188OpenAlexW2978274064WikidataQ127231999 ScholiaQ127231999MaRDI QIDQ5218249

Ludovic Patey, Peter A. Cholak

Publication date: 2 March 2020

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Catalan numberRamseyreverse mathematicsthin setDNChyperarithmetic setarithmetic setcone avoidanceDGAPdiagonal noncomputability

Mathematics Subject Classification ID

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)

RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ The weakness of the pigeonhole principle under hyperarithmetical reductions ⋮ Lawvere-Tierney topologies for computability theorists

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive recursion and the chain antichain principle
• The weakness of being cohesive, thin or free in reverse mathematics
• On the strength of Ramsey's theorem
• Generics for computable Mathias forcing
• Some logically weak Ramseyan theorems
• On degrees of unsolvability
• On uniform relationships between combinatorial problems
• Open Questions in Reverse Mathematics
• Partial Orders and Immunity in Reverse Mathematics
• Iterative Forcing and Hyperimmunity in Reverse Mathematics
• Classifying model-theoretic properties
• Hyperarithmetically Encodable Sets
• RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS
• Catalan Numbers
• Bounding prime models
• ∏ 0 1 Classes and Degrees of Theories
• Ramsey's theorem and recursion theory

This page was built for publication: Thin set theorems and cone avoidance