Compactness in Team Semantics

Tutkimustuotos: TyöpaperiEsipainos


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.
Alkuperäiskielimuu / ei tiedossa
TilaJulkaistu - 7 jouluk. 2022
OKM-julkaisutyyppiEi sovellu

Siteeraa tätä