4 papers · 1 filter
Non-computability of -theory for computably presented C*-algebras
Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl +1
We give an example of a unital C*-algebra with a computable presentation and for which neither nor has a computable presentation.
Computable -theory for C*-algebras II: AF algebras
Christopher J. Eagle, Isaac Goldbring, Timothy H. McNicholl
We continue the study of the effective content of -theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to…
On definability of C*-tensor norms
Isaac Goldbring, Thomas Sinclair
We initiate the study of definability (in the model-theoretic sense) of C*-tensor norms. We show that neither the minimal nor maximal tensor norms are definable uniformly over all…
Totally Bounded Elements in W*-probability Spaces
Jananan Arulseelan, Isaac Goldbring, Bradd Hart +1
We introduce the notion of a totally (-) bounded element of a W*-probability space and, borrowing ideas of Kadison, give an intrinsic characterization of the -suba…