Ludovic Patey

From MaRDI portal
Person:490868

Available identifiers

zbMath Open patey.ludovicWikidataQ61849586 ScholiaQ61849586MaRDI QIDQ490868

List of research outcomes

PublicationDate of PublicationType
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective2024-02-20Paper
Carlson-Simpson's lemma and applications in reverse mathematics2023-07-26Paper
https://portal.mardi4nfdi.de/entity/Q50397532022-10-04Paper
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS2022-04-12Paper
RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION2022-04-12Paper
THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS2022-04-12Paper
The weakness of the pigeonhole principle under hyperarithmetical reductions2021-11-03Paper
Computing sets from all infinite subsets2021-10-21Paper
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models2021-08-23Paper
COH, SRT 2 2 , and multiple functionals2021-06-25Paper
Ramsey’s theorem and products in the Weihrauch degrees2020-11-09Paper
Some results concerning the SRT 2 2 vs. COH problem2020-11-09Paper
Thin set theorems and cone avoidance2020-03-02Paper
The Rado path decomposition theorem2019-12-17Paper
Pigeons do not jump high2019-07-19Paper
\({\Pi}_1^0\)-encodability and omniscient reductions2019-05-29Paper
Partial orders and immunity in reverse mathematics2019-03-20Paper
A computable analysis of variable words theorems2019-01-07Paper
The proof-theoretic strength of Ramsey's theorem for pairs and two colors2018-06-22Paper
On the logical strengths of partial solutions to mathematical problems2018-05-25Paper
Coloring the rationals in reverse mathematics2018-01-18Paper
Iterative forcing and hyperimmunity in reverse mathematics2017-11-22Paper
The reverse mathematics of non-decreasing subsequences2017-09-15Paper
Coloring trees in reverse mathematics2017-09-04Paper
Dominating the Erdős-Moser theorem in reverse mathematics2017-08-29Paper
OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS2017-05-26Paper
THE STRENGTH OF THE TREE THEOREM FOR PAIRS IN REVERSE MATHEMATICS2017-04-28Paper
Diagonally non-computable functions and fireworks2017-03-16Paper
Controlling iterated jumps of solutions to combinatorial problems2017-02-23Paper
The weakness of being cohesive, thin or free in reverse mathematics2017-01-11Paper
Ramsey’s theorem for singletons and strong computable reducibility2016-12-29Paper
Partial Orders and Immunity in Reverse Mathematics2016-08-17Paper
Ramsey-type graph coloring and diagonal non-computability2015-11-18Paper
Iterative Forcing and Hyperimmunity in Reverse Mathematics2015-10-20Paper
Degrees bounding principles and universal instances in reverse mathematics2015-08-21Paper
The complexity of satisfaction problems in reverse mathematics2015-07-01Paper
The Complexity of Satisfaction Problems in Reverse Mathematics2015-02-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ludovic Patey