加载中…
We show that the universal theory of the hyperfinite II factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem has a negative solution that avoids the equivalences with Kirchberg’s QWEP Conjecture and Tsirelson’s Problem.+

生成讲解博客的中文版本

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