A computability-theoretic reformulation of the Connes Embedding Problem
Operator Algebras
2013-08-13 v1 Logic
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.
Cite
@article{arxiv.1308.2638,
title = {A computability-theoretic reformulation of the Connes Embedding Problem},
author = {Isaac Goldbring and Bradd Hart},
journal= {arXiv preprint arXiv:1308.2638},
year = {2013}
}
Comments
9 pages