Papers
Topics
Authors
Recent
Search
2000 character limit reached

Ultrafilter extensions of bounded graphs are elementary

Published 27 May 2024 in math.LO | (2405.17101v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Zalán Molnár 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 2 tweets with 2 likes about this paper.

Sign Up for Free