arXiv Analytics

Sign in

arXiv:2502.09451 [math.LO]AbstractReferencesReviewsResources

Notes on ultrafilter extensions of almost bounded structures

Zalán Molnár

Published 2025-02-13Version 1

We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded structures, where a universal finite bound on the maximal in-and out-degree is given, ultrafilter extensions are elementary extensions of the original structures. Comparing the constructions, it seems that the real challenge is when the degree has no global finite bound, or there are elements with infinite degree. This is a first step towards this direction by slightly relaxing the notion of boundedness, called almost bounded structures. Among others, we show that members of this class are still elementary substructures of their extensions, elementary embeddings can be lifted up to the extensions, moreover for the countable case, the extensions are isomorphic to certain ultrapowers. We also comment on the modal logics they generate.

Related articles: Most relevant | Search more
arXiv:2405.17101 [math.LO] (Published 2024-05-27)
Ultrafilter extensions of bounded graphs are elementary
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