Abstract
In this paper, we introduce a logic based on team semantics, called FOT, whose expressive power coincides with first-order logic both on the level of sentences and (open) formulas, and we also show that a sublogic of FOT, called FOT${}^\downarrow$, captures exactly downward closed first-order team properties. We axiomatize completely the logic FOT, and also extend the known partial axiomatization of dependence logic to dependence logic enriched with the logical constants in FOT${}^\downarrow$.
| Original language | English |
|---|---|
| Title of host publication | Logic, Language, Information, and Computation |
| Publisher | Springer |
| Pages | 392-414 |
| ISBN (Print) | 978-3-662-59533-6, 978-3-662-59532-9 |
| DOIs | |
| Publication status | Published - 18 Apr 2019 |
| Externally published | Yes |