arXiv · 1308.2638
A computability-theoretic reformulation of the Connes Embedding Problem
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.
Explore related subjects
Keep this discovery
Isaac Goldbring, Bradd Hart. 2013-08-12. A computability-theoretic reformulation of the Connes Embedding Problem. https://arxiv.org/abs/1308.2638
Cite the original work for its findings. Save a collection to share your selection of sources.