2000 character limit reached
The isomorphism theorem for linear fragments of continuous logic
Published 2 Oct 2019 in math.LO | (1910.00776v1)
Abstract: The ultraproduct construction is generalized to $p$-ultramean constructions ($1\leqslant p<\infty$) by replacing ultrafilters with finitely additive measures. These constructions correspond to the linear fragments $\mathscr Lp$ of continuous logic. A powermean variant of Keisler-Shelah isomorphism theorem is proved for $\mathscr Lp$. It is then proved that $\mathscr Lp$-sentences (and their approximations) are exactly those sentences of continuous logic which are preserved by such constructions. Some other applications are also given.
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.