pith. sign in

arxiv: 2605.23321 · v1 · pith:5FPVBCXOnew · submitted 2026-05-22 · 💻 cs.LO · cs.MA

Arrow-Type Impossibility for Genuinely Modal Judgments

Yutaka Nagai , Hirotaka Ono This is my paper

Pith reviewed 2026-05-25 03:15 UTC · model grok-4.3

classification 💻 cs.LO cs.MA
keywords judgment aggregationmodal logicimpossibility theoremdictatorshipcyclic framesemantic reductionpath connectivity
0
0 comments X

The pith

Arrow-type impossibility re-emerges for modal judgments on a simple cyclic frame generated from one variable and one modal operator.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that classical impossibility results in judgment aggregation, which typically require strong logical interconnections among factual propositions, also apply when judgments are required to be modal. It does this by considering an agenda built from a single propositional variable using repeated applications of one modal operator on a cyclic frame. A semantic reduction theorem allows collapsing iterated modal patterns, which in turn reveals minimally inconsistent judgment sets that are sufficiently path-connected to trigger dictatorship under standard aggregation axioms. This shows that the semantic structure of the modal frame alone can generate the necessary interconnections without reducing to plain factual aggregation.

Core claim

We prove an impossibility theorem on a simple cyclic frame for an agenda generated from a single propositional variable by repeated applications of a single modal operator, and we further demonstrate this phenomenon for an alternative family of frames satisfying a natural symmetry condition. Thus, even under a modal-operator requirement, semantic structure alone can generate the logical interconnections needed for dictatorship. Technically, our analysis has two layers. First, we prove a semantic reduction theorem showing that certain iterated modal patterns can be collapsed by shifting the evaluation point. Second, building on this reduction, we identify a local-to-global frame mechanism by

What carries the argument

A semantic reduction theorem that collapses certain iterated modal patterns by shifting the evaluation point, together with a local-to-global frame mechanism that produces minimally inconsistent modal judgment sets with strong path-connectivity.

If this is right

  • Dictatorship is forced for aggregation rules satisfying standard axioms even when all judgments are modal.
  • The same reduction turns consistency checking into a combinatorial covering problem, enabling efficient non-dictatorial procedures in some cases.
  • Impossibility holds for frames satisfying a natural symmetry condition in addition to the cyclic case.
  • The phenomenon arises without any fact-based propositions in the agenda.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the reduction theorem generalizes, similar impossibilities may appear in other modal logics with limited operators.
  • Practical modal judgment aggregation systems might need to relax connectivity assumptions or use different frames to avoid dictatorship.
  • Testing the symmetry condition on real-world modal frames could reveal whether impossibility is widespread.
  • The combinatorial covering problem suggests computational approaches to finding consistent aggregations.

Load-bearing premise

That the chosen modal frames and operator-generated agenda produce minimally inconsistent judgment sets whose path-connectivity is sufficient to trigger the classical impossibility mechanism while remaining genuinely modal.

What would settle it

Constructing a non-dictatorial aggregation function on the cyclic frame that satisfies the standard axioms without producing inconsistent collective judgments on the modal agenda.

Figures

Figures reproduced from arXiv: 2605.23321 by Hirotaka Ono, Yutaka Nagai.

Figure 2
Figure 2. Figure 2: Examples of Frame 1 and 2 Frame classes used in this paper. Fix positive integers r > k ≥ 1 and a nonempty subset A ⊆ Z/rZ. We refer to Appendix B for the definition of Z/rZ and its addition +. We consider the following two classes of Kripke frames. 4 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Frame 2 with W = Z/6Z, k = 1, and A = {0, 1}. The ellipses mean the sets of worlds {w, w + 1}. A + (−3) A + 3 A + 0 −3 0 3 6 (a) J+ = {−3, 3} A + (−1) A + 2 A + 0 −3 0 3 6 (b) J+ = {−1, 2} [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Examples of consistent and inconsistent choices of [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: A pointed minimal cover (0, k, {−1, k}) The following definition isolates the set-theoretic structure that yields the required logical interconnections. Definition 4.2. Let w0, w1 ∈ Z/rZ and S0 ⊆ Z/rZ with |S0| ≥ 2 and w1 ∈ S0. The triple (w0, w1, S0) is a pointed minimal cover if the following conditions are satisfied. 1. Minimality: ∪s∈S0A+s is a minimal cover of A+w0. That is, for all S1 ⊆ S0, A+w0 ⊆ ∪s… view at source ↗
Figure 6
Figure 6. Figure 6: A covering of A + w π(m) π(m) + k A + π(m) A + w0 w0 w0 + k (a) w0 − π(m) ∈ [−k, −1] π(m) π(m) + k A + π(m) A + w0 w0 w0 + k (b) w0 − π(m) ∈ [1, k] [PITH_FULL_IMAGE:figures/full_fig_p013_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Two cases of the relative position of A + w0 and A + π(m). Lemma 5.3. For all w ∈ Z/rZ, A + w ⊆ ∪w0∈J+ A + w0 if and only if cvle[w] + cvri[w] ≤ k + 1. We estimate the computation time in step (2a), (2b) and (2c). First, we set cvle[w] = cvri[w] = k + 1 for all w ∈ Z/rZ. In step (2a), from Lemma 5.1, it is enough to check if A + π(m) ⊆ ∪w∈J+ A + w. From Lemma 5.3, it is enough to check if cvle[π(m)]+cvri[π… view at source ↗
Figure 8
Figure 8. Figure 8: k-symmetry with W = Z/6Z, k = 2, and A = {0, 1, 2} Before proving Theorem 4, we show Lemma C.2. Lemma C.2. Suppose (W, R) is Frame 2. If the set A is k-symmetric, then for all worlds w ∈ Z/rZ, modal formulas Φ, and valuations V ⊆ Z/rZ, (Z/rZ, R, V ) ⊨ w + k : Φ implies (Z/rZ, R, V ) ⊨ w : ✷✸Φ and (Z/rZ, R, V ) ⊨ w : ✸✷Φ implies (Z/rZ, R, V ) ⊨ w + k : Φ. Example 4 illustrates that (Z/rZ, R, V ) ⊨ w + k : Φ… view at source ↗
read the original abstract

Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under natural aggregation axioms. In this paper, we ask whether such impossibility can still arise when the objects of aggregation are required to be genuinely modal judgments rather than plain factual propositions. Since modal logic contains propositional logic, this question is meaningful only if one excludes fact-based aggregation in disguise. We show that Arrow-type impossibility already re-emerges in a strikingly sparse modal setting. We prove an impossibility theorem on a simple cyclic frame for an agenda generated from a single propositional variable by repeated applications of a single modal operator, and we further demonstrate this phenomenon for an alternative family of frames satisfying a natural symmetry condition. Thus, even under a modal-operator requirement, semantic structure alone can generate the logical interconnections needed for dictatorship. Technically, our analysis has two layers. First, we prove a semantic reduction theorem showing that certain iterated modal patterns can be collapsed by shifting the evaluation point. Second, building on this reduction, we identify a local-to-global frame mechanism by which frame geometry yields minimally inconsistent modal judgment sets and the strong path-connectivity required for impossibility. The same reduction also turns consistency checking into a small combinatorial covering problem, which yields efficient implementations of non-dictatorial aggregation procedures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper claims to prove an Arrow-type impossibility theorem for judgment aggregation over genuinely modal judgments. It constructs an agenda from a single propositional variable under iterated applications of one modal operator on a simple cyclic frame (and a symmetric family of frames), shows via a semantic reduction theorem that certain iterated modal patterns collapse by evaluation-point shift, and uses the resulting frame geometry to produce minimally inconsistent judgment sets with sufficient path-connectivity to trigger dictatorship under standard aggregation axioms. The same reduction is said to convert consistency checking into a combinatorial covering problem yielding efficient non-dictatorial procedures.

Significance. If the semantic reduction preserves irreducible modal interconnections rather than collapsing to propositional contradictions, the result would demonstrate that frame semantics alone can generate the logical structure required for classical impossibility results even under an explicit modal-operator requirement and in an extremely sparse setting. The provision of an efficient combinatorial procedure for non-dictatorial aggregation would also be a practical contribution.

major comments (2)
  1. [Abstract] Abstract (semantic reduction theorem): the description states that iterated modal patterns (e.g., □□p, □□□p, …) are collapsed by shifting the evaluation point along the cycle, yet supplies no derivation showing that the resulting formulas remain modally distinct at the relevant worlds rather than becoming propositionally equivalent; without this, the claim that the agenda is “genuinely modal” and not reducible to fact-based aggregation cannot be verified and is load-bearing for the central thesis.
  2. [Abstract] Abstract (local-to-global frame mechanism): the argument that frame geometry yields minimally inconsistent modal judgment sets whose path-connectivity triggers the classical impossibility mechanism is asserted but not accompanied by any explicit construction, error bounds, or verification that the inconsistency arises from modal rather than propositional interconnections; this step is load-bearing for both the impossibility theorem and the “non-reducible” premise.
minor comments (1)
  1. [Abstract] The abstract refers to “efficient implementations” obtained from the combinatorial covering problem but gives no complexity bounds, example runtimes, or pseudocode.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thoughtful report and for identifying two points where the abstract could more clearly signal the location and nature of the supporting arguments. We address each comment below. The full derivations appear in the body of the manuscript; we are prepared to strengthen the abstract accordingly.

read point-by-point responses

  1. Referee: [Abstract] Abstract (semantic reduction theorem): the description states that iterated modal patterns (e.g., □□p, □□□p, …) are collapsed by shifting the evaluation point along the cycle, yet supplies no derivation showing that the resulting formulas remain modally distinct at the relevant worlds rather than becoming propositionally equivalent; without this, the claim that the agenda is “genuinely modal” and not reducible to fact-based aggregation cannot be verified and is load-bearing for the central thesis.

    Authors: The semantic reduction theorem (Theorem 3.2) and its proof establish that the iterated formulas collapse under point-shift evaluation while preserving modal non-equivalence at the worlds of interest; the proof proceeds by induction on modal depth and uses the cyclic frame geometry to exhibit distinct accessibility paths. The abstract condenses this result. We will revise the abstract to include a one-sentence pointer to the theorem and the key non-equivalence step. revision: partial

  2. Referee: [Abstract] Abstract (local-to-global frame mechanism): the argument that frame geometry yields minimally inconsistent modal judgment sets whose path-connectivity triggers the classical impossibility mechanism is asserted but not accompanied by any explicit construction, error bounds, or verification that the inconsistency arises from modal rather than propositional interconnections; this step is load-bearing for both the impossibility theorem and the “non-reducible” premise.

    Authors: Section 4 supplies the explicit construction: the minimally inconsistent sets are obtained by lifting the reduced modal patterns along the cycle, and path-connectivity is verified by exhibiting a covering of the agenda whose inconsistency graph is a cycle of length greater than 2. The inconsistency is shown to be modal by demonstrating that no propositional assignment satisfies the reduced set. We will add a brief clause in the abstract indicating that the construction and verification appear in Section 4. revision: partial

Circularity Check

0 steps flagged

No circularity; theorem derived independently from frame semantics and aggregation axioms

full rationale

The paper proves an impossibility result via a semantic reduction theorem on cyclic frames followed by a local-to-global connectivity argument. This is a standard deductive chain in modal logic: the reduction is derived from the frame definition and evaluation rules, then applied to generate minimally inconsistent judgment sets without redefining the target result in terms of itself. No self-citations are load-bearing, no parameters are fitted and renamed as predictions, and the construction explicitly aims to preserve modal distinctness. The derivation remains self-contained against the stated assumptions and does not reduce to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result rests on standard modal logic semantics and classical judgment aggregation axioms; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption Standard judgment aggregation axioms (unanimity, independence of irrelevant alternatives, etc.)
    The impossibility is derived by showing that these axioms plus the modal frame structure force dictatorship.
  • standard math Kripke semantics for modal logic on frames
    The semantic reduction and inconsistency generation rely on evaluation-point shifting on the given frames.

pith-pipeline@v0.9.0 · 5763 in / 1209 out tokens · 29244 ms · 2026-05-25T03:15:49.778743+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages

  1. [1]

    Arrow.Social Choice and Individual Values

    Kenneth J. Arrow.Social Choice and Individual Values. John Wiley & Sons, New York, 2 edition, 1963

    work page 1963

  2. [2]

    Dynamic logic of propositional assignments: A well-behaved variant of pdl

    Philippe Balbiani, Andreas Herzig, and Nicolas Troquard. Dynamic logic of propositional assignments: A well-behaved variant of pdl. In2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, page 143–152. IEEE, June 2013

    work page 2013

  3. [3]

    Cambridge University Press, June 2001

    Patrick Blackburn, Maarten de Rijke, and Yde Venema.Modal Logic. Cambridge University Press, June 2001

    work page 2001

  4. [4]

    Cambridge University Press, September 2014

    Nicolas de Condorcet.Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix. Cambridge University Press, September 2014. 22

    work page 2014

  5. [5]

    A generalised model of judgment aggregation.Social Choice and Welfare, 28(4):529–565, August 2006

    Franz Dietrich. A generalised model of judgment aggregation.Social Choice and Welfare, 28(4):529–565, August 2006

    work page 2006

  6. [6]

    Arrow’s theorem in judgment aggregation.Social Choice and Welfare, 29(1):19–33, October 2006

    Franz Dietrich and Christian List. Arrow’s theorem in judgment aggregation.Social Choice and Welfare, 29(1):19–33, October 2006

    work page 2006

  7. [7]

    Aggregation of binary evaluations.Journal of Economic Theory, 145(2):495–511, March 2010

    Elad Dokow and Ron Holzman. Aggregation of binary evaluations.Journal of Economic Theory, 145(2):495–511, March 2010

    work page 2010

  8. [8]

    Dowling and Jean H

    William F. Dowling and Jean H. Gallier. Linear-time algorithms for testing the satisfiability of proposi- tional horn formulae.The Journal of Logic Programming, 1(3):267–284, October 1984

    work page 1984

  9. [9]

    Arrow’s impossibility theorem: Concise proof and infinite voters.Journal of Economic Theory, 2(1):103–106, March 1970

    Peter C Fishburn. Arrow’s impossibility theorem: Concise proof and infinite voters.Journal of Economic Theory, 2(1):103–106, March 1970

    work page 1970

  10. [10]

    The model-theoretic approach to aggregation: Impossibility results for finite and infinite electorates.Mathematical Social Sciences, 64(1):41–47, 2012

    Frederik Herzberg and Daniel Eckert. The model-theoretic approach to aggregation: Impossibility results for finite and infinite electorates.Mathematical Social Sciences, 64(1):41–47, 2012

    work page 2012

  11. [11]

    Arrow’s theorem, many agents, and invisible dictators.Journal of Economic Theory, 5(2):267–277, October 1972

    Alan P Kirman and Dieter Sondermann. Arrow’s theorem, many agents, and invisible dictators.Journal of Economic Theory, 5(2):267–277, October 1972

    work page 1972

  12. [12]

    the three bugs problem

    M. S. Klamkin and D. J. Newman. Cyclic pursuit or “the three bugs problem”.The American Mathematical Monthly, 78(6):631–639, June 1971

    work page 1971

  13. [13]

    Kornhauser and Lawrence G

    Lewis A. Kornhauser and Lawrence G. Sager. Unpacking the court.The Yale Law Journal, 96(1):82, November 1986

    work page 1986

  14. [14]

    Aggregating sets of judgments: An impossibility result.Economics and Philosophy, 18(1):89–110, March 2002

    Christian List and Philip Pettit. Aggregating sets of judgments: An impossibility result.Economics and Philosophy, 18(1):89–110, March 2002

    work page 2002

  15. [15]

    Marshall, M.E

    J.A. Marshall, M.E. Broucke, and B.A. Francis. Formations of vehicles in cyclic pursuit.IEEE Transactions on Automatic Control, 49(11):1963–1974, November 2004

    work page 1963

  16. [16]

    Kenneth O. May. A set of independent necessary and sufficient conditions for simple majority decision. Econometrica, 20(4):680, October 1952

    work page 1952

  17. [17]

    Proof analysis in modal logic.Journal of Philosophical Logic, 34(5–6):507–544, October 2005

    Sara Negri. Proof analysis in modal logic.Journal of Philosophical Logic, 34(5–6):507–544, October 2005

    work page 2005

  18. [18]

    Judgment aggregation in dynamic logic of propositional assignments.Journal of Logic and Computation, 28(7):1471–1498, August 2018

    Arianna Novaro, Umberto Grandi, and Andreas Herzig. Judgment aggregation in dynamic logic of propositional assignments.Journal of Logic and Computation, 28(7):1471–1498, August 2018

    work page 2018

  19. [19]

    Distributed coordination d-stabilization in cyclic pursuit formations of dynamical multi-agent systems.Actuators, 13(12):495, December 2024

    Jun-Gyu Park, Yeongjae Kim, and Tae-Hyoung Kim. Distributed coordination d-stabilization in cyclic pursuit formations of dynamical multi-agent systems.Actuators, 13(12):495, December 2024

    work page 2024

  20. [20]

    Parsegov, Pavel Y

    Sergei E. Parsegov, Pavel Y . Chebotarev, Pavel S. Shcherbakov, and Federico Martín Ibáñez. Hierarchical cyclic pursuit: Algebraic curves containing the laplacian spectra.IEEE Transactions on Control of Network Systems, 10(4):1720–1731, December 2023

    work page 2023

  21. [21]

    Axiomatizing collective judgment sets in a minimal logical language.Synthese, 158(2):233–250, June 2007

    Marc Pauly. Axiomatizing collective judgment sets in a minimal logical language.Synthese, 158(2):233–250, June 2007

    work page 2007

  22. [22]

    Judgments aggregation by a sequential majority procedure.Mathe- matical Social Sciences, 95:37–46, September 2018

    Bezalel Peleg and Shmuel Zamir. Judgments aggregation by a sequential majority procedure.Mathe- matical Social Sciences, 95:37–46, September 2018

    work page 2018

  23. [23]

    Deliberative democracy and the discursive dilemma.Philosophical Issues, 11(1):268–299, October 2001

    Philip Pettit. Deliberative democracy and the discursive dilemma.Philosophical Issues, 11(1):268–299, October 2001. 23

    work page 2001

  24. [24]

    Judgement aggregation in non-classical logics.Journal of Applied Non-Classical Logics, 27(1–2):106–139, April 2017

    Daniele Porello. Judgement aggregation in non-classical logics.Journal of Applied Non-Classical Logics, 27(1–2):106–139, April 2017

    work page 2017

  25. [25]

    Judgment aggregation in nonmonotonic logic.Synthese, 195(8):3651–3683, March 2017

    Xuefeng Wen. Judgment aggregation in nonmonotonic logic.Synthese, 195(8):3651–3683, March 2017

    work page 2017

  26. [26]

    On the logic of preference and judgment aggregation.Autonomous Agents and Multi-Agent Systems, 22(1):4–30, October 2009

    Thomas Ågotnes, Wiebe van der Hoek, and Michael Wooldridge. On the logic of preference and judgment aggregation.Autonomous Agents and Multi-Agent Systems, 22(1):4–30, October 2009. 24

    work page 2009