Article contents
COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM
Published online by Cambridge University Press: 05 July 2016
Abstract
The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.
- Type
- Articles
- Information
- Copyright
- Copyright © The Association for Symbolic Logic 2016
References
REFERENCES
- 4
- Cited by