2000 character limit reached
The Universal Theory Of The Hyperfinite II$_1$ Factor Is Not Computable
Published 10 Jun 2020 in math.LO and math.OA | (2006.05629v3)
Abstract: We show that the universal theory of the hyperfinite II$_1$ 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.+
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
