💻 computer science

Arrow-Type Impossibility for Genuinely Modal Judgments

This paper demonstrates that Arrow-type impossibility results in judgment aggregation re-emerge even when restricted to genuinely modal judgments, proving that specific modal semantic structures alone can generate the logical interconnections necessary for dictatorship without relying on disguised factual propositions.

Original authors: Yutaka Nagai, Hirotaka Ono

Published 2026-05-25

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Yutaka Nagai, Hirotaka Ono

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a group of friends trying to make a single, unified decision about a complex topic. Usually, we think of these topics as simple facts: "It is raining," "The meeting is at 2 PM," or "Alice is in New York." If everyone agrees on the facts, the group agrees. But what if the facts are tricky? What if the group is trying to decide things like "It must be raining," "It might be raining," or "It cannot be raining"?

This paper asks a very specific question: If we force a group to only vote on these "might/must/cannot" (modal) statements, can we still get into a situation where the only way to make a consistent group decision is to let one person be the boss (a dictator)?

In the world of logic and voting, this is known as an "Arrow-type impossibility." It's a fancy way of saying: "No matter how fair your voting rules are, the logic of the situation forces a dictatorship."

Here is the simple breakdown of what the authors found, using some everyday analogies.

1. The Old Problem: The "Doctrinal Paradox"

To understand the new discovery, you have to know the old one. Imagine a court case.

Fact A: The defendant broke the contract.
Fact B: The defendant was negligent.
Conclusion: The defendant is liable (because A and B must both be true).

If three judges vote:

Judge 1: Yes on A, Yes on B, Yes on Liability.
Judge 2: Yes on A, No on B, No on Liability.
Judge 3: No on A, Yes on B, No on Liability.

If you vote on each fact separately, the majority says "Yes" to A and "Yes" to B. So, logically, the group should say "Yes" to Liability. But if you vote on Liability directly, the majority says "No." The group ends up with a contradictory mess.

The authors of this paper wanted to know: Does this mess happen even if we remove the simple facts (A and B) and only vote on the "Must/Might" versions?

2. The New Discovery: The "Modal Trap"

The authors say: Yes, the trap is still there.

They built a scenario where the group is only allowed to vote on statements like "It is necessary that X" or "It is possible that Y." They stripped away all the plain facts. You might think that by making the rules more abstract and "fuzzy" (using possibility and necessity), the logical connections would loosen, making it easier to agree.

The Surprise: The authors found that the very structure of "possibility" and "necessity" creates its own hidden traps. Even without plain facts, the logical connections between "might" and "must" are so tight that they force the group into a contradiction unless one person dictates the answer.

3. The Analogy: The "Circular Dance Floor"

To prove this, the authors used a mathematical model that looks like a circular dance floor with numbered spots (0, 1, 2, ...).

The Rules: Imagine you are standing on a spot. You can only "see" (access) the spots that are a certain number of steps away from you.
The Voting: The group has to decide if a statement is true based on what they can see from their spot.
The "Shift": The authors discovered a magic trick. Because the dance floor is perfectly symmetrical, if you shift your position by a specific number of steps, a complex chain of "might" and "must" statements collapses into a simple statement about a new spot.

The Metaphor:
Imagine you are trying to cover a table with overlapping blankets (the "modal statements").

In a normal room, you might think you can arrange the blankets so they don't clash.
But on this specific circular dance floor, the authors showed that the blankets are shaped in a way that they must overlap in a specific, unavoidable pattern.
If you try to arrange them to avoid a contradiction, you find that the blankets cover the whole table in a way that leaves no room for a fair compromise. The only way to stop the chaos is for one person to say, "I decide where the blankets go."

4. Why This Matters (According to the Paper)

The paper makes two main points:

The Trap is Inevitable: You cannot escape the "dictatorship problem" just by switching from simple facts to complex "modal" judgments. The geometry of the logic itself creates the conflict. It's not that the people are bad at voting; it's that the rules of the game (the logic of possibility) force a dictatorship.
The Silver Lining (Efficiency): While they proved that a dictatorship is unavoidable if you try to vote on every single statement independently, they also found a way to make the process efficient if you don't try to be independent on every single point.

They showed that because the "modal" statements can be reduced to simple math problems (like covering a table with blankets), computers can quickly calculate a fair, non-dictatorial outcome if you use a specific step-by-step voting method. It's like realizing that while you can't solve a puzzle by guessing every piece at once, you can solve it very quickly if you follow a specific pattern.

Summary

The Question: If we only vote on "must/might" statements, do we still get stuck in logical contradictions that force a dictatorship?
The Answer: Yes. The structure of "possibility" and "necessity" creates its own rigid logical chains that lead to the same dead ends as simple facts.
The Method: They used a circular, symmetrical model (like a dance floor) to show how these logical chains connect.
The Result: Even in a world of pure "maybe" and "must," the logic is so tight that a group cannot agree without one person taking charge. However, they also found a fast, computer-friendly way to reach a group decision if the group is willing to follow a specific, non-independent voting procedure.

Technical Summary: Arrow-Type Impossibility for Genuinely Modal Judgments

Problem Statement
Judgment aggregation investigates how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results (e.g., List and Pettit, Dietrich and List) demonstrate that sufficiently strong logical interconnections among propositions force dictatorship under natural aggregation axioms (Unanimity, Independence, Neutrality). However, these results primarily concern the aggregation of plain factual propositions.

This paper addresses a specific gap: whether Arrow-type impossibility persists when the objects of aggregation are required to be genuinely modal judgments (involving necessity $\Box$ and possibility $\Diamond$ operators) rather than factual propositions in disguise. A naive inclusion of modal formulas alongside propositional ones would trivially reproduce classical impossibilities. The authors instead isolate a setting where every aggregated item must involve modal operators. The central question is whether the semantic structure of modal logic itself—specifically the geometry of Kripke frames—can generate the logical interconnections necessary to force dictatorship, even in the absence of explicit propositional interconnections.

Methodology
The authors analyze judgment aggregation over specific classes of Kripke frames (Frame 1 and Frame 2) defined on cyclic groups $\mathbb{Z}/r\mathbb{Z}$ . The agendas consist of iterated modal formulas generated from a single propositional variable $p$ (e.g., $\Box^j p$ or $(\Box\Diamond)^j \Box p$ ).

The technical approach relies on two main layers:

Semantic Reduction: The authors prove a semantic reduction theorem (Theorem 1) for frames satisfying a $k$ -symmetry condition. This theorem demonstrates that certain iterated modal patterns (specifically $\Box\Diamond\Box\Phi$ ) can be semantically collapsed by shifting the evaluation point by a fixed distance $k$ . This transforms complex modal consistency questions into a finite combinatorial problem involving set covers of the accessibility relation's domain.
Frame-Based Impossibility Criterion: Building on the reduction, the authors define an "impossibility frame" as a Kripke frame where the agenda is both minimally connected (containing a minimally inconsistent subset of size $\ge 3$ ) and strongly path-connected (allowing a chain of logical dependencies between any two non-negated formulas). They prove that if a frame satisfies these conditions, any aggregation rule satisfying Unanimity and Positive-Negative Neutrality must be dictatorial (Theorem 2).

Key Contributions and Results

Semantic Reduction Theorem (Theorem 1): The paper establishes that in symmetric cyclic frames, the truth of a complex modal formula at a world $w$ is equivalent to the truth of a simpler formula at a shifted world $w+k$ . This reduces modal consistency checking to a combinatorial covering problem on the set of accessible worlds.
Impossibility in Sparse Modal Settings (Theorem 3): The authors construct specific impossibility frames where $r$ $r$ and $k$ $k$ are coprime and the accessibility set $A$ $A$ satisfies specific inclusion properties. They prove that even for agendas generated by a single propositional variable and a single modal operator (e.g., $\Box^j p$ $□^{j} p$ ), the semantic structure alone generates the necessary logical interconnections. Specifically:
- For Frame 1 (a "pointed" cyclic frame), the agenda $\{\Box^j p, \neg \Box^j p\}_{j \ge 1}$ forces dictatorship.
- For Frame 2 (a purely cyclic frame) with $k$ -symmetry, the agenda $\{(\Box\Diamond)^j \Box p, \neg (\Box\Diamond)^j \Box p\}_{j \ge 0}$ forces dictatorship.
- The proof identifies a "pointed minimal cover" structure in the set translates $A+w$ , which yields minimally inconsistent judgment sets and strong path-connectivity via a coprimality argument.
Algorithmic Tractability: While impossibility results hold, the same semantic reduction enables efficient implementation of non-dictatorial aggregation procedures. The authors apply the sequential majority procedure of Peleg and Zamir. By reducing consistency checking to a small combinatorial covering problem (specifically checking if a set translate is covered by the union of others), they derive algorithms with polynomial time complexity ( $O(r \cdot |A|)$ or $O(r \cdot k)$ ) for verifying consistency and constructing collective judgments.

Significance and Claims
The paper claims that Arrow-type impossibility is not confined to rigid propositional agendas or fact-based aggregation. Instead, the semantic structure of modal logic itself—specifically the geometry of the underlying Kripke frames—can generate the logical interconnections required to force dictatorship. This suggests that modal semantics should be viewed not merely as a richer language for aggregation, but as a direct source of aggregation-theoretic obstruction.

The authors emphasize that their results clarify the scope of impossibility in computational social choice: even in highly sparse modal settings where the objects of aggregation are strictly modal, dictatorship can be forced. Conversely, the structural analysis that leads to impossibility also provides the algorithmic leverage needed to implement efficient, non-dictatorial aggregation procedures that respect consistency, linking the theoretical limits of aggregation with algorithmic tractability through a common semantic reduction.