Definably amenable groups in Continuous logic
Abstract: We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both notions using fixed-point properties. We show that stable and ultracompact groups are definably amenable and prove that, for groups definable in dependent theories, definable amenability is equivalent to the existence of an f-generic type. Finally, we show the randomizations of first-order definably amenable groups are extremely definably amenable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.