📝 SummarXiv

Abstract

Building on Lin's breakthrough MIP$^{co}$ = coRE and an encoding of non-local games as universal sentences in the language of tracial von Neumann algebras, we show that locally universal tracial von Neumann algebras have undecidable universal theories. This implies that no such algebra admits a computable presentation. Our results also provide, for the first time, explicit examples of separable II$_1$ factors without computable presentations, and in fact yield a broad family of them, including McDuff factors, factors without property Gamma, and property (T) factors. We also obtain analogous results for locally universal semifinite von Neumann algebras and tracial C*-algebras. The latter provides strong evidence for a negative solution to the Kirchberg Embedding Problem. We discuss how these are obstructions to approximation properties in the class of tracial and semifinite von Neumann algebras.