arXiv:2405.17101 [math.LO]AbstractReferencesReviewsResources
Ultrafilter extensions of bounded graphs are elementary
Published 2024-05-27Version 1
The main motivation of this paper is the study of first-order model theoretic properties of structures having their roots in modal logic. We will focus on the connections between ultrafilter extensions and ultrapowers. We show that certain structures (called bounded graphs) are elementary substructures of their ultrafilter extensions, moreover their modal logics coincide.
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:2502.09451 [math.LO] (Published 2025-02-13)
Notes on ultrafilter extensions of almost bounded structures
arXiv:1310.4533 [math.LO] (Published 2013-10-16)
Ultrafilter extensions of linear orders
arXiv:1712.06198 [math.LO] (Published 2017-12-17)
Ultrafilter extensions do not preserve elementary equivalence