加载中…
Le Houérou, Patey and Yokoyama defined a parameterized version of -largeness to prove that is a -conservative extension of , where is the universal set-closure of the class of -formulas. We introduce a variant of this notion of largeness and obtain polynomial bounds, using a tree partition theorem based on Milliken’s tree theorem. Thanks to the framework of forcing interpretation, this yields that any proof of a -sentence in the theory can be translated into a proof in at the cost of a polynomial increase in size.

生成讲解博客的中文版本

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