加载中…
We use forcing over admissible sets to show that, for every ordinal in a club , there are copies of such that the isomorphism between them is not computable in the join of the complete set relative to each copy separately. Assuming , this is close to optimal; on the other hand, assuming large cardinals the same (and more) holds for every projective functional.

生成讲解博客的中文版本

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