加载中…
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal , implies that holds above , and (3) forcing posets which have the -approximation property also have the countable covering property. These results solve open problems of Viale and Hachtman-Sinapova.

生成讲解博客的中文版本

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