We prove that the Cohesiveness Principle (COH) is $\Pi^1_1$ conservative over $RCA_0 + I\Sigma^0_n$ and over $RCA_0 + B\Sigma^0_n$ for all $n \geq 2$ by recursion-theoretic means. We first characterize COH over $RCA_0 + B\Sigma^0_2$ as a `jumped' version of Weak K\"{o}nig's Lemma (WKL) and develop suitable machinery including a version of the Friedberg jump-inversion theorem. The main theorem is obtained when we combine these with known results about WKL. In an appendix we give a proof of the $\Pi^1_1$ conservativity of WKL over $RCA_0$ by way of the Superlow Basis Theorem and a new proof of a recent jump-inversion theorem of Towsner
peer reviewedWe prove that the equivalence between Vershik’s standardness criterion and the I-cosin...
International audienceThe tree theorem for pairs (TT 2 2), first introduced by Chubb, Hirst, and McN...
We initiate the study of compact group actions on C*-algebras from the perspective of model theory, ...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
Abstract. In this paper we study with proof-theoretic methods the func-tion(al)s provably recursive ...
International audienceInformally, a mathematical statement is robust if its strength is left unchang...
We study some generalized notions of cohesiveness which arise naturally in connection with effective...
AbstractBy RCA0, we denote the system of second-order arithmetic based on recursive comprehension ax...
Let be a countably innite property (T) group, and let A be UHF-algebra of innite type. We prove tha...
International audienceWe answer a question posed by Hirschfeldt and Jockusch by showing that wheneve...
In this paper we develop mathematically strong systems of analysis inhigher types which, nevertheles...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
We study the pigeonhole principle for Σ2-definable injections with domain twice as large as the codo...
peer reviewedWe prove that the equivalence between Vershik’s standardness criterion and the I-cosin...
International audienceThe tree theorem for pairs (TT 2 2), first introduced by Chubb, Hirst, and McN...
We initiate the study of compact group actions on C*-algebras from the perspective of model theory, ...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
Abstract. In this paper we study with proof-theoretic methods the func-tion(al)s provably recursive ...
International audienceInformally, a mathematical statement is robust if its strength is left unchang...
We study some generalized notions of cohesiveness which arise naturally in connection with effective...
AbstractBy RCA0, we denote the system of second-order arithmetic based on recursive comprehension ax...
Let be a countably innite property (T) group, and let A be UHF-algebra of innite type. We prove tha...
International audienceWe answer a question posed by Hirschfeldt and Jockusch by showing that wheneve...
In this paper we develop mathematically strong systems of analysis inhigher types which, nevertheles...
The enterprise of comparing mathematical theorems according to their logical strength is an active a...
Abstract. We study the reverse mathematics and computability-the-oretic strength of (stable) Ramsey’...
International audienceRamsey's theorem for n-tuples and k-colors (RT n k) asserts that every k-color...
We study the pigeonhole principle for Σ2-definable injections with domain twice as large as the codo...
peer reviewedWe prove that the equivalence between Vershik’s standardness criterion and the I-cosin...
International audienceThe tree theorem for pairs (TT 2 2), first introduced by Chubb, Hirst, and McN...
We initiate the study of compact group actions on C*-algebras from the perspective of model theory, ...