2000 character limit reached
Model-theoretic Characterizations of Large Cardinals (1708.07561v3)
Published 24 Aug 2017 in math.LO
Abstract: We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{\kappa, \kappa}$, this allows us to characterize any large cardinal defined in terms of normal ultrafilters, and we also analyze second-order and sort logic. In particular, we give a compactness for omitting types characterization of huge cardinals, which have consistency strength beyond Vop\v{e}nka's Principle.
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.