COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM
Copyright policy )COMPUTABILITY AND THE CONNES EMBEDDING PROBLEM
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.
- McMaster University Canada
- University of the Sciences United States
computability, General theory of von Neumann algebras, \(\mathrm{II}_1\) factors, Computable structure theory, computable model theory, Models of other mathematical theories, Theory of numerations, effectively presented structures, Connes embedding problem
computability, General theory of von Neumann algebras, \(\mathrm{II}_1\) factors, Computable structure theory, computable model theory, Models of other mathematical theories, Theory of numerations, effectively presented structures, Connes embedding problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!