COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM Journal Articles

abstract

• AbstractThe 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.

authors

• GOLDBRING, ISAAC
• Hart, Bradd

status

• published 

publication date

• June 2016

has subject area

• 0101 Pure Mathematics (FoR)
• 0802 Computation Theory and Mathematics (FoR)
• General Mathematics (Science Metrix)

published in

• Bulletin of Symbolic Logic  Journal

keywords

• ALGEBRAS
• Connes Embedding Problem
• II1 FACTORS
• II1 factors
• Logic
• MODEL-THEORY
• Mathematics
• Physical Sciences
• Science & Technology
• Science & Technology - Other Topics
• computability

Digital Object Identifier (DOI)

• 10.1017/bsl.2016.5

start page

• 238

end page

• 248

volume

• 22

issue

• 2