加载中…
We show that over the weak base theory , cohesive Ramsey’s theorem for pairs implies exponential closure of the definable cut , which is the intersection of all -definable cuts. Consequences include non-elementary proof speedup of over for sentences and the unprovability of in . On the other hand, we show that , where is stable Ramsey’s theorem for pairs, is polynomially simulated by with respect to proofs of sentences. Nevertheless, also implies a nontrivial property of , specifically closure under functions of quasipolynomial growth rate.

生成讲解博客的中文版本

生成AI智能校验的中文版本