28 pagesInternational audienceWe study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a question of Brattka, by showing that Ramsey's theorem for pairs ($\mathsf{RT}^2_2$) is strictly Weihrauch below the parallel product of the stable Ramsey's theorem for pairs and the cohesive principle ($\mathsf{SRT}^2_2 \times \mathsf{COH}$)
International audienceWe answer a question posed by Hirschfeldt and Jockusch by showing that wheneve...
Abstract. We show that the principle PART from Hirschfeldt and Shore [7] is equivalent to the Σ02-Bo...
We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihr...
28 pagesInternational audienceWe study the positions in the Weihrauch lattice of parallel products o...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
We study the reverse mathematics and computability-theoretic strength of (stable) Ramsey’s Theorem f...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
this paper we study the logical strength of Ramsey's Theorem (1930), especially of Ramsey'...
Abstract. In this paper we study with proof-theoretic methods the func-tion(al)s provably recursive ...
Ramsey theory is a dynamic area of combinatorics that has various applications in analysis, ergodic ...
he main objective of this research is to study the relative strength of combinatorial principles, in...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
The computability-theoretic and reverse mathematical aspects of various combinatorial principles, su...
Ramsey theory is the study of the structure of mathematical objects that is preserved under partitio...
International audienceWe answer a question posed by Hirschfeldt and Jockusch by showing that wheneve...
Abstract. We show that the principle PART from Hirschfeldt and Shore [7] is equivalent to the Σ02-Bo...
We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihr...
28 pagesInternational audienceWe study the positions in the Weihrauch lattice of parallel products o...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
We study the reverse mathematics and computability-theoretic strength of (stable) Ramsey’s Theorem f...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
this paper we study the logical strength of Ramsey's Theorem (1930), especially of Ramsey'...
Abstract. In this paper we study with proof-theoretic methods the func-tion(al)s provably recursive ...
Ramsey theory is a dynamic area of combinatorics that has various applications in analysis, ergodic ...
he main objective of this research is to study the relative strength of combinatorial principles, in...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
The computability-theoretic and reverse mathematical aspects of various combinatorial principles, su...
Ramsey theory is the study of the structure of mathematical objects that is preserved under partitio...
International audienceWe answer a question posed by Hirschfeldt and Jockusch by showing that wheneve...
Abstract. We show that the principle PART from Hirschfeldt and Shore [7] is equivalent to the Σ02-Bo...
We investigate the uniform computational content of the open and clopen Ramsey theorems in the Weihr...