Abstract. In this paper we study with proof-theoretic methods the func-tion(al)s provably recursive relative to Ramsey’s theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functionals provably recursive from RCA0 + COH + Π01-CP are primitive recursive. This also provides a uni-form method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that WKL0 + Π01-CP + COH is Π02-conservative over PRA. Recent work of the first author showed that Π01-CP + COH is equivalent to a weak variant of the Bolzano-Weierstraß principle. This makes it possible to use our results to analyze not only combinatorial but also analytical proofs. For Ramsey’s theorem for...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
Abstract. We discuss the use of nonstandard methods in the study of Ramsey type problems, and illust...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
We study the reverse mathematics and computability-theoretic strength of (stable) Ramsey’s Theorem f...
Abstract. We show that the principle PART from Hirschfeldt and Shore [7] is equivalent to the Σ02-Bo...
We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ ...
he main objective of this research is to study the relative strength of combinatorial principles, in...
28 pagesInternational audienceWe study the positions in the Weihrauch lattice of parallel products o...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
Abstract. We discuss the use of nonstandard methods in the study of Ramsey type problems, and illust...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
In this thesis we give a proof-theoretic account of the strength of Ramsey's theorem for pairs and r...
We study the reverse mathematics and computability-theoretic strength of (stable) Ramsey’s Theorem f...
Abstract. We show that the principle PART from Hirschfeldt and Shore [7] is equivalent to the Σ02-Bo...
We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ ...
he main objective of this research is to study the relative strength of combinatorial principles, in...
28 pagesInternational audienceWe study the positions in the Weihrauch lattice of parallel products o...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
We produce a first order proof of a famous combinatorial result, Ramsey Theorem for pairs and in two...
We give the Π^0_2-part, the Π^0_3-part and the Π^0_4-part of RT^2_2 and related combinatorialprincip...
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignmen...
Abstract. We discuss the use of nonstandard methods in the study of Ramsey type problems, and illust...
In this thesis, we study the proof-theoretical and computational strength of some combinatorial prin...