The flattening operator in team-based logics
Preprint
Abstract
We propose a systematic study of the so-called flattening operator in team semantics. This operator was first introduced by Hodges in 1997, and has not been studied in more detail since. We begin a systematic study of the expressive power this operator adds to the most well-known team-based logics, such as dependence logic, anonymity logic, inclusion logic and exclusion logic.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Probabilistic Team Semantics2018
- Approximation and dependence via multiteam semanticsAnnals of Mathematics and Artificial Intelligence, 2018
- The Logic of Approximate Dependence2017
- Dependence and IndependenceStudia Logica, 2013
- Independence in Database Relations2013
- Erratum to: On Definability in Dependence LogicJournal of Logic, Language and Information, 2010
- On Definability in Dependence LogicJournal of Logic, Language and Information, 2009
- The Closure of Monadic NPJournal of Computer and System Sciences, 2000
- Some strange quantifiers1997
- The Structure of the Relational Database Model1989