A Game-Theoretic Unital Classification Theorem for -Algebras
arXiv:2601.01735
Abstract
We study the complexity of the -equivalence relation on unital -algebras, in the sense of descriptive set theory. We prove that -equivalence is analytic, which in turn shows that the set of separable -algebras satisfying the UCT is analytic. This allows us to prove a game-theoretic refinement of the unital classification theorem: there is a transfer of strategies between Ehrenfeucht-Fraïssé games (of various lengths) on classifiable -algebras and their invariants.
46 pages. Submitted version