A recursion theoretic analysis of the clopen Ramsey theorem
From MaRDI portal
Recommendations
- An inside/outside Ramsey theorem and recursion theory
- scientific article; zbMATH DE number 3916250
- An analysis of Ramsey's theorem
- scientific article; zbMATH DE number 2058397
- A refinement of the Ramsey hierarchy via indescribability
- scientific article; zbMATH DE number 704226
- Ramsey-like theorems and moduli of computation
- A dichotomy result for Ramsey quantifiers
- A packed Ramsey’s theorem and computability theory
- A note on Ramsey theorems and Turing jumps
Cites work
Cited in
(7)- Proving Ramsey's theory by the cover set induction: A case and comparision study.
- Intuitionism: an inspiration?
- Optimal bounds for ordinal comparison maps
- A generalization of the limit lemma and clopen games
- scientific article; zbMATH DE number 4029558 (Why is no real title available?)
- Foundations of BQO Theory
- On Nash-Williams' theorem regarding sequences with finite range
This page was built for publication: A recursion theoretic analysis of the clopen Ramsey theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3691655)