arXiv Analytics

Sign in

arXiv:2006.05629 [math.LO]AbstractReferencesReviewsResources

The Universal Theory Of The Hyperfinite II$_1$ Factor Is Not Computable

Isaac Goldbring, Bradd Hart

Published 2020-06-10Version 1

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.+

Categories: math.LO, math.OA
Subjects: 03C66, 03C98, 46L10
Related articles: Most relevant | Search more
arXiv:2312.16650 [math.LO] (Published 2023-12-27)
Axiomatizability of hereditary classes of structures of finite and infinite languages and decidability of their universal theories
arXiv:0912.1072 [math.LO] (Published 2009-12-06, updated 2011-12-19)
Computable de Finetti measures
arXiv:1403.1805 [math.LO] (Published 2014-03-07, updated 2014-08-20)
The Universal Theory of First Order Algebras and Various Reducts

Links

Toolbox