Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
Publication:6201447
DOI10.1090/MEMO/1457arXiv2007.09739MaRDI QIDQ6201447
Benoit Monin, Peter A. Cholak, Damir D. Dzhafarov, Paul-Elliot Anglès d'Auriac, Ludovic Patey
Publication date: 20 February 2024
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.09739
reverse mathematicsRamsey's theorempartition theorystructural Ramsey theorycomputable combinatoricsMilliken's tree theorem
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal set theory (05D05) Generalized Ramsey theory (05C55) Applications of set theory (03E75) Ramsey theory (05D10) Other combinatorial set theory (03E05) Applications of computability and recursion theory (03D80)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Canonical partitions of universal structures
- Coloring subgraphs of the Rado graph
- Counting canonical partitions in the random graph
- A dual form of Ramsey's theorem
- A Ramsey theorem for trees
- Big Ramsey degrees and topological dynamics
- On the strength of Ramsey's theorem
- Coloring trees in reverse mathematics
- Some logically weak Ramseyan theorems
- Degrees of members of \(\Pi_ 1^ 0\) classes
- Rainbow Ramsey simple structures
- On the strength of Ramsey's theorem for pairs
- Turing Computability
- THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS
- Algorithmic Randomness and Complexity
- On notions of computability-theoretic reduction between Π21 principles
- Slicing the Truth
- Introduction to Ramsey Spaces (AM-174)
- Reverse mathematics, computability, and partitions of trees
- Ramsey's theorem and cone avoidance
- A Partition Theorem for the Infinite Subtrees of a Tree
- Partitions of Products
- On sets of integers containing k elements in arithmetic progression
- Splitting an α-Recursively Enumerable Set
- On the Independence of the Kinna Wagner Principle
- Coloring the rationals in reverse mathematics
- The strength of Ramsey’s theorem for pairs over trees: I. Weak König’s Lemma
- Weihrauch Complexity in Computable Analysis
- Thin set theorems and cone avoidance
- Cohesive avoidance and strong reductions
- A Partition Theorem
- ∏ 0 1 Classes and Degrees of Theories
- Ramsey's theorem and recursion theory
- SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE
This page was built for publication: Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
