COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES

Abstract In this paper, we introduce a logic based on team semantics, called $\mathbf {FOT} $ , whose expressive power is elementary, i.e., coincides with first-order both the level of sentences and (possibly open) formulas, also show that sublogic {FOT}^{\downarrow } captures exactly downward closed elementary (or first-order) properties. We axiomatize completely extend known partial axiomatization dependence to enriched logical constants in .