Ultrafilter extensions of bounded graphs are elementary

DOI10.1007/S11225-024-10148-8MaRDI QIDQ7237607zbMATH OpenFDO

Authors

Publication date 30 April 2026

Published in Studia Logica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11225-024-10148-8

zbMATH Keywords

bounded graphselementary substructuresultrafilter extension

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• Boolean Algebras with Operators
• Canonical modal logics and ultrafilter extensions
• Characterizations of negative definability in modal logic
• Elementary generation and canonicity for varieties of Boolean algebras with operators
• Erdős Graphs Resolve Fine's Canonicity Problem
• Goldblatt-Thomason-style theorems for graded modal language
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 4041866 (Why is no real title available?)
• scientific article; zbMATH DE number 3494368 (Why is no real title available?)
• scientific article; zbMATH DE number 3499717 (Why is no real title available?)
• scientific article; zbMATH DE number 3508462 (Why is no real title available?)
• scientific article; zbMATH DE number 1749143 (Why is no real title available?)
• Modal formulas are either elementary or not ΣΔ-elementary
• Modal languages and bounded fragments of predicate logic
• Modal logic
• Model theory.
• On the lattice of extensions of the modal logics \(KAlt_ n\)
• Tools and techniques in modal logic
• Ultrafilter extensions do not preserve elementary equivalence
• Ultrafilter extensions of models
• Varieties of complex algebras

This page was built for publication: Ultrafilter extensions of bounded graphs are elementary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7237607)