arXiv Open Access 2024

Ultrafilter extensions of bounded graphs are elementary

Zalán Molnár

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.LO

Penulis (1)

Zalán Molnár

Format Sitasi

APA MLA BibTeX

Molnár, Z. (2024). Ultrafilter extensions of bounded graphs are elementary. https://arxiv.org/abs/2405.17101

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2024
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓