The flattening operator in team-based logics

📅 2025-05-27
📈 Citations: 0
✹ Influential: 0
📄 PDF
đŸ€– AI Summary
This paper systematically investigates the expressive impact of Hodges’ (1997) flattening operator within team semantics. Addressing major team-based logics—including dependence logic, anonymity logic, inclusion logic, and exclusion logic—it provides the first precise characterization of the operator’s expressive boundaries. Using model-theoretic analysis, comparative expressivity studies, and definability theory, the work reveals a fundamental shift in logical strength induced by flattening: it establishes strict expressivity hierarchies among these logics while uncovering key undefinability results—demonstrating that, despite enhancing expressivity, the flattening operator cannot overcome certain intrinsic definability barriers. The study fills a long-standing gap in the systematic investigation of this operator and delivers foundational metatheoretical insights for team logics, clarifying both its capabilities and inherent limitations in capturing semantic properties over teams.

Technology Category

Application Category

📝 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.
Problem

Research questions and friction points this paper is trying to address.

Study flattening operator in team semantics
Analyze expressive power in team-based logics
Explore impact on dependence and anonymity logics
Innovation

Methods, ideas, or system contributions that make the work stand out.

Studies flattening operator in team semantics
Analyzes expressive power in team logics
Focuses on dependence and anonymity logics
🔎 Similar Papers
No similar papers found.