Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Preservation theorems for strong first-order logics (1906.09173v2)

Published 21 Jun 2019 in math.LO and math.CT

Abstract: We prove preservation theorems for $\mathcal{L}{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}{\omega_1, \omega}$ preserved by substructures (resp. homomorphic images). The solution, in $ZFC$, only uses general features and can be extended to several variants of other strong first-order logic that do not satisfy the interpolation theorem; instead, the results on infinitary definability are used. This solves an open problem dating back to 1977. Another consequence of our approach is the equivalence of the Vop\v{e}nka principle and a general definability theorem on subsets preserved by homomorphisms.

Summary

We haven't generated a summary for this paper yet.