3 papers
math.OA2026
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.
math.LO2025
Computability for tree presentations of continuum-size structures
Jason Block, Russell Miller
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now…
math.LO2025
Computable -theory for -algebras: UHF algebras
Christopher Eagle, Isaac Goldbring, Timothy McNicholl +1
We initiate the study of the effective content of -theory for -algebras. We prove that there are computable functors which associate, to a computably enumerable pr…