Compactness in team semantics

Abstract: We provide two proofs of the compactness theorem for extensions of first‐order logic based on team semantics. First, we build upon Lück's [16] ultraproduct construction for team semantics and prove a suitable version of Łoś' Theorem. Second, we show that by working with suitably saturated models, we can generalize the proof of Kontinen and Yang [13] to sets of formulas with arbitrarily many variables.

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
Compactness in team semantics ; day:27 ; month:05 ; year:2024 ; extent:20
Mathematical logic quarterly ; (27.05.2024) (gesamt 20)

Creator
Puljujärvi, Joni
Quadrellaro, Davide Emilio

DOI
10.1002/malq.202200072
URN
urn:nbn:de:101:1-2405281408575.963936525625
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
14.08.2025, 11:01 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Puljujärvi, Joni
  • Quadrellaro, Davide Emilio

Other Objects (12)