The flattening operator in team-based logics
Arnaud Durand, Juha Kontinen, Werner M\'erian, Jouko V\"a\"an\"anen

TL;DR
This paper systematically studies the flattening operator in team semantics, exploring its impact on the expressive power of various team-based logics like dependence, anonymity, inclusion, and exclusion logic.
Contribution
It provides the first detailed analysis of the flattening operator's role in enhancing the expressive capabilities of key team-based logics.
Findings
The flattening operator increases the expressive power of dependence logic.
It clarifies the operator's role across different team-based logics.
The study offers foundational insights into the operator's theoretical significance.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems
