Partition Theorems and Computability Theory

DOI10.2178/BSL/1122038995MaRDI QIDQ3370615zbMATH OpenOpenAlexFDO

Authors Joseph R. Mileti

Publication date 8 February 2006

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/bsl/1122038995

zbMATH Keywords

canonicalcomputabilitypartitionRamseyregressivereverse mathematicssurvey

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Theory of numerations, effectively presented structures (03D45) Applications of computability and recursion theory (03D80) Second- and higher-order arithmetic and fragments (03F35) Ramsey theory (05D10)

Recommendations

• The canonical Ramsey theorem and computability theory
• On the strength of Ramsey's theorem for pairs
• Reverse mathematics, computability, and partitions of trees
• (Un)countable and (non)effective versions of Ramsey's theorem
• On the uniform computational content of Ramsey's theorem

Cites work

• A _2⁰ set with no infinite low subset in either it or its complement
• A cohesive set which is not high
• Class groups of integral group rings
• Effective versions of Ramsey's Theorem: Avoiding the cone above 0′
• Generalized cohesiveness
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1908324 (Why is no real title available?)
• scientific article; zbMATH DE number 2236640 (Why is no real title available?)
• Note on Canonical Partitions
• On Gödel incompleteness and finite combinatorics
• On the strength of Ramsey's theorem
• On the strength of Ramsey's theorem for pairs
• Ramsey's theorem and recursion theory

Cited in

(19)

• The polarized Ramsey's theorem
• The proof-theoretic strength of Ramsey's theorem for pairs and two colors
• \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
• Weaker cousins of Ramsey's theorem over a weak base theory
• Pigeons do not jump high
• Coloring trees in reverse mathematics
• Weakly represented families in reverse mathematics
• Some Questions in Computable Mathematics
• (Un)countable and (non)effective versions of Ramsey's theorem
• On notions of computability-theoretic reduction between Π21 principles
• Partitions with no Coarsenings of Higher Degree
• On the logical strengths of partial solutions to mathematical problems
• Degrees bounding principles and universal instances in reverse mathematics
• The weakness of being cohesive, thin or free in reverse mathematics
• Ramsey-like theorems and moduli of computation
• Open questions about Ramsey-type statements in reverse mathematics
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• The Ginsburg-Sands theorem and computability theory
• Automorphisms of models of arithmetic: a unified view

This page was built for publication: Partition Theorems and Computability Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3370615)