2000 character limit reached
Locally universal C*-algebras with computable presentations
Published 4 Mar 2023 in math.LO, cs.CC, and math.OA | (2303.02301v1)
Abstract: The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\mathcal{O}_2$. In an effort to provide a negative solution to the KEP and motivated by the recent refutation of the Connes Embedding Problem, we establish two computability-theoretic consequences of a positive solution to KEP. Both of our results follow from the a priori weaker assumption that there exists a locally universal C*-algebra with a computable presentation.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.