Journal article
THE UNIVERSAL THEORY OF THE HYPERFINITE II FACTOR IS NOT COMPUTABLE
Abstract
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.
Authors
GOLDBRING I; HART B
Journal
Bulletin of Symbolic Logic, Vol. 30, No. 2, pp. 181–198
Publisher
Cambridge University Press (CUP)
Publication Date
6 2024
DOI
10.1017/bsl.2024.7
ISSN
1079-8986