I will sketch a proof of the statement in the title and outline how it is related to Ehrenfeucht–Fraïssé games on C*-algebras. I will provide the relevant background on C*-algebras (and descriptive set theory) and explain how to construct a standard Borel category X that can play a role of their `moduli'. The theorem from the title is an application of the compactness theorem, for a suitable first-order theory whose models correspond to functors from X. If time permits, I will mention some related problems and connections with conceptual completeness for infinitary logic. This talk is based on several discussions with Ehud Hrushovski, Jennifer Pi, Mira Tartarotti, and Stuart White after a reading group on the paper "Games on AF-algebras" by Ben De Bondt, Andrea Vaccaro, Boban Velickovic and Alessandro Vignati.

I will talk about preliminaries in Arakelov geometry. Also, a historical overview will be provided. This talk will be the basis of a later talk about the theory of globally valued fields.

The Morse-Conley complex is a central object in information compression in topological data analysis, as well as the application of homological algebra to analysing dynamical systems. Given a poset-graded chain complex, its Morse-Conley complex is the optimal chain-homotopic reduction of the initial complex that respects the poset grading.  In this work, we give a purely algebraic derivation of the Morse-Conley complex using homological perturbation theory. Unlike Forman’s discrete Morse theory for cellular complexes, our algebraic formulation does not require the computation of acyclic partial matchings of cells.  We show how this algebraic perspective also yields efficient algorithms for computing the Conley complex.  This talk features joint work with Álvaro Torras Casas and Ulrich Pennig in "Computing Connection Matrices of Conley Complexes via Algebraic Morse Theory" (arXiv:2503.09301).