The following pages link to Ludovic Patey (Q490868):
Displayed 43 items.
- Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- Diagonally non-computable functions and fireworks (Q515575) (← links)
- Ramsey-type graph coloring and diagonal non-computability (Q892143) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- \( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models (Q2048618) (← links)
- The Rado path decomposition theorem (Q2279931) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- The reverse mathematics of non-decreasing subsequences (Q2402955) (← links)
- \({\Pi}_1^0\)-encodability and omniscient reductions (Q2418778) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Controlling iterated jumps of solutions to combinatorial problems (Q2964279) (← links)
- THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS (Q2976343) (← links)
- Partial Orders and Immunity in Reverse Mathematics (Q3188275) (← links)
- Iterative Forcing and Hyperimmunity in Reverse Mathematics (Q3195708) (← links)
- Iterative forcing and hyperimmunity in reverse mathematics (Q4593493) (← links)
- Coloring the rationals in reverse mathematics (Q4601029) (← links)
- Partial orders and immunity in reverse mathematics (Q4628351) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- A computable analysis of variable words theorems (Q4644466) (← links)
- COH, SRT 2 2 , and multiple functionals (Q4995606) (← links)
- (Q5039753) (← links)
- RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS (Q5070462) (← links)
- RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION (Q5070463) (← links)
- THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS (Q5070472) (← links)
- Ramsey’s theorem and products in the Weihrauch degrees (Q5131643) (← links)
- Some results concerning the SRT 2 2 vs. COH problem (Q5131650) (← links)
- Computing sets from all infinite subsets (Q5158110) (← links)
- The weakness of the pigeonhole principle under hyperarithmetical reductions (Q5163163) (← links)
- The Complexity of Satisfaction Problems in Reverse Mathematics (Q5175906) (← links)
- Thin set theorems and cone avoidance (Q5218249) (← links)
- The complexity of satisfaction problems in reverse mathematics (Q5261155) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Carlson-Simpson's lemma and applications in reverse mathematics (Q6109087) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- Pi01 encodability and omniscient reductions (Q6271099) (← links)
- Relationships between computability-theoretic properties of problems (Q6315397) (← links)
- COH, SRT22, and multiple functionals (Q6318066) (← links)
- SRT22 does not imply RT22 in omega-models (Q6319076) (← links)
- The reverse mathematics of the Thin set and Erd\H{o}s-Moser theorems (Q6362798) (← links)
- Partition genericity and pigeonhole basis theorems (Q6395827) (← links)