2000 character limit reached
A computability-theoretic reformulation of the Connes Embedding Problem (1308.2638v1)
Published 12 Aug 2013 in math.OA and math.LO
Abstract: The Connes Embedding Problem (CEP) asks whether every separable II_1 factor embeds into an ultrapower of the hyperfinite II_1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II_1 von Neumann algebra. We also derive some further computability-theoretic consequences of the CEP.