Compactness in Team Semantics
Logic
2025-01-24 v1
Abstract
We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem. Second, we show that by working with suitably saturated models, we can generalize the proof of Kontinen and Yang to sets of formulas with arbitrarily many variables.
Cite
@article{arxiv.2212.03677,
title = {Compactness in Team Semantics},
author = {Joni Puljujärvi and Davide Emilio Quadrellaro},
journal= {arXiv preprint arXiv:2212.03677},
year = {2025}
}