Ramsey's theorem and König's lemma
From MaRDI portal
Publication:866890
DOI10.1007/S00153-006-0025-ZzbMATH Open1114.03038OpenAlexW2093301140WikidataQ124866322 ScholiaQ124866322MaRDI QIDQ866890FDOQ866890
Authors: T. E. Forster, John K. Truss
Publication date: 14 February 2007
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-006-0025-z
Recommendations
- Reverse mathematics and a Ramsey-type König's lemma
- The strength of Ramsey's theorem for pairs over trees. I: Weak König's lemma
- Ramsey's theorem for pairs and \(k\) colors as a sub-classical principle of arithmetic
- Reverse mathematics and Ramsey's property for trees
- On the strength of Ramsey's theorem for trees
Cites Work
Cited In (11)
- Some combinatorics involving ξ-large sets
- Dickson's lemma and weak Ramsey theory
- Hindman’s theorem in the hierarchy of choice principles
- König's infinity lemma and Beth's tree theorem
- König's lemma, weak König's lemma, and the decidable fan theorem
- On Ramsey's theorem and the existence of infinite chains or infinite anti-chains in infinite posets
- Binary consistent choice on pairs and a generalization of Konig's infinity lemma
- On the Mikusiński-Antosik diagonal theorem and the equivalence of two types of convergence in Köthe spaces
- Separating principles below \(\mathsf{WKL}_0\)
- Countable sets versus sets that are countable in reverse mathematics
- Mapping among the nodes of infinite trees: a variation of Kőnig's infinity lemma
This page was built for publication: Ramsey's theorem and König's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866890)