This will be a talk at the UW Madison Logic Seminar on 22 October 2024.

Abstract. The principle of covering reflection holds of a cardinal κ if for every structure B in a countable first-order language there is a structure A of size less than κ, such that B is covered by elementary images of A in B. Is there any such cardinal? Is the principle consistent? Does it have large cardinal strength? This is joint work with myself, Nai-Chung Hou, Andreas Lietz, and Farmer Schlutzenberg.
The talk will reportedly streamed online, so kindly contact the organizers for access.
I will be staying in Madison for a few days to talk logic with researchers there.