Compactness in Team Semantics
From MaRDI portal
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.
This page was built for publication: Compactness in Team Semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419851)
