pith. sign in

arxiv: 2605.26883 · v1 · pith:4P6OADKZnew · submitted 2026-05-26 · 💻 cs.LO

A Dynamic Deontic Simplicial Logic for Joint Commitments

Giorgio Cignarale , Hugo Rincon Galeana This is my paper

Pith reviewed 2026-06-29 15:04 UTC · model grok-4.3

classification 💻 cs.LO
keywords deontic logicsimplicial complexesjoint commitmentsdynamic logicgroup obligationssoundness and completenessmulti-agent systems
0
0 comments X

The pith

Simplicial complexes receive a deontic interpretation in which vertices stand for individual commitments and higher simplices stand for joint group obligations.

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

The paper develops Deontic Simplicial Logic to model group obligations by assigning a deontic reading to simplicial complexes. Vertices represent the commitments of single agents while higher-dimensional simplices represent the joint obligations of groups. It extends the approach to Dynamic Deontic Simplicial Logic that incorporates updates to capture how individual and joint actions alter these commitments and models agents' choices among mutually exclusive options. Soundness and completeness are proved for both the static and dynamic logics. A sympathetic reader would care because the framework supplies a geometric structure for tracking how shared duties arise and change in multi-agent settings.

Core claim

The paper establishes the first deontic interpretation of simplicial models in which vertices represent individual commitments and higher-dimensional simplices represent joint obligations of groups of agents. It extends this to Dynamic Deontic Simplicial Logic, the first dynamic logic based on simplicial complexes, that models agents' choices among mutually exclusive commitments and captures the effects of individual and joint actions via update operations on simplicial models, with soundness and completeness proved for both logics.

What carries the argument

Simplicial complexes under a deontic interpretation, with vertices as individual commitments and higher simplices as joint obligations, plus update operations that model the effects of actions.

If this is right

  • Group obligations receive a direct geometric representation as higher-dimensional simplices rather than derived constructs.
  • Changes to commitments due to actions are handled uniformly through model updates that preserve the simplicial structure.
  • Reasoning about choices among alternative commitments becomes possible within the same framework.
  • Both the static and dynamic logics admit sound and complete axiomatizations relative to the simplicial semantics.

Where Pith is reading between the lines

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

  • The simplicial approach could be combined with existing epistemic simplicial logics to reason simultaneously about knowledge and obligation.
  • Verification tools for distributed protocols might adopt the update operations to check preservation of joint commitments after collective actions.
  • The geometric view may suggest new axioms or frame conditions for other deontic operators by exploiting topological properties of simplicial complexes.

Load-bearing premise

Simplicial complexes can serve as a semantic domain in which the distinction between vertices and higher simplices directly aligns with the distinction between individual and joint commitments, and the defined updates correctly reflect the results of actions.

What would settle it

An explicit counter-model in which an update operation on a simplicial complex fails to produce the structure expected after a described individual or joint action, or a formula valid under the intended semantics that the logic cannot derive.

Figures

Figures reproduced from arXiv: 2605.26883 by Giorgio Cignarale, Hugo Rincon Galeana.

Figure 1
Figure 1. Figure 1: Simplices of various dimensions. and the epistemic interpretation of simplicial complexes is well established [4,34,30,8,20]. Formally, a simplicial complex consists of a set of vertices together with a collec￾tion of simplices, where a simplex is a finite set of vertices. In particular, every subset of a simplex is itself a simplex and every vertex appears as a simplex on its own. A simplex is called face… view at source ↗
Figure 2
Figure 2. Figure 2: Simplicial model C with four possible configurations Y, X, Z, W. towards each agent in the group and also to the group itself. The crucial differ￾ence from the standard account is that we require G ⊆ χ(X), as it might not always be the case in impure simplicial complexes. From a semantic perspective, the mutual commitment DGφ is true if φ is true in all simplices that share a G-colored face with it. This m… view at source ↗
Figure 3
Figure 3. Figure 3: Pure simplicial model C where every agent has a commitment to each other and to the group (left). Impure simplicial model C ′ where only a and b have mutual commitment to each other (middle). Impure simplicial model C ′′ where each agent has a pairwise commitment with one another, but no joint commitment to the group (right). pa pb pc X ¬pb Y C ¬pc pa pb pc X ′ ¬pb ¬pc W′ Y ′ C ′ pa pb pc X ′′ ¬pb C ′′ Y ′… view at source ↗
Figure 4
Figure 4. Figure 4: Simplicial models representing different examples from Example 4, from left to right: versions 4, 5 and 6. 3 Soundness and completeness of DSL We begin by providing the following axiomatization for the DSL logic: Definition 5 (Axiom system DSL). For G ⊆ A and φ ∈ LDSL we introduce the following axiom system: – Taut: Propositional tautologies – K: DG(φ → ψ) → (DGφ → DGψ) – T: DGφ → φ – 4: DGφ → DGDGφ – N: φ… view at source ↗
Figure 5
Figure 5. Figure 5: The 1-skel operation of complex C. 3.1 Properties of deontic simplicial models A key advantage of the simplicial structure is that it allows structural properties of the normative landscape to be read off directly from the geometry. For exam￾ple, checking whether a complex allows for a configuration where all agents share at least one joint commitment equals checking whether the simplicial model has at lea… view at source ↗
Figure 6
Figure 6. Figure 6: Star operation and Link operation from vertex v. Other powerful tools, expressing commitments (or lack thereof) from the per￾spective of agents (or group of agents), include the star and the link operations: Definition 17 (Star). Let C be a simplicial complex. The star of a simplex X ∈ C, written Star(X, C) is the subcomplex of C whose facets are the maximal simplices of C that contains X. Theorem 18. Give… view at source ↗
Figure 7
Figure 7. Figure 7: Examples of simplicial commitment update models. U (left) represents the single agent action where a commits to pa. U ′ (middle) illustrates the joint action β{a,b} made of single actions βa and βb where a and b jointly commit to p. U ′′ (right) represents the simultaneous (but not joint) action where a and c commit to p while b does not alter her commitments (⊤), but with no joint commitment. – pa ∈ l u (… view at source ↗
Figure 8
Figure 8. Figure 8: Simplicial models for Example 25. Initial simplicial model C (left) with two possible configurations, X (everybody commits to p) and Y (a and c commit to p, b to ¬p). simplicial commitment update model U (middle), where b commits to pb and a and c do not alter their commitments. Resulting simplicial model C ⊗ U (right), where all agents are committed to do p. Our goal is to use actions to model agent choic… view at source ↗
Figure 9
Figure 9. Figure 9: Simplicial commitment update model U ′ (left) representing a and c’s joint commitment to p and simultaneous but not joint commitment of b to ¬p, without any commitment to the others. Resulting model C ⊗ U′ (right) representing a and c’s joint commitment to p and b’s commitment to ¬p. γa ⊤ ⊤ γc U ′′ (v3,γa) pa pc (v1,γc) C ⊗ U′′ [PITH_FULL_IMAGE:figures/full_fig_p018_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Simplicial commitment update model U ′′ (left) representing a and c’s joint commitment to p and the absence of any commitment of b. Resulting model C ⊗ U′′ (right) representing a and c’s joint commitment to p. commitment for agent b, namely in vertex (v4, βb), although it is not a joint commitment: C ⊗ U′ ,(v4, βb) |= D{b}¬pb. Example 27 (Ghosting). We use again the same starting scenario as above, depict… view at source ↗
read the original abstract

In this paper we introduce the novel Deontic Simplicial Logic (DSL), a deontic logic for group obligations based on simplicial complexes. We provide the first deontic interpretation of simplicial models in which vertices represent individual commitments and higher-dimensional simplices represent joint obligations of groups of agents. We further extend DSL to the Dynamic Deontic Simplicial Logic (DDSL), resulting in the first dynamic logic based on simplicial complexes. DDSL models agents' choices among mutually exclusive commitments and captures the effects of individual and joint actions via update operations on simplicial models. We prove soundness and completeness for both the static and dynamic deontic simplicial logics. We motivate our results with multiple examples, both in the static and dynamic settings.

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

0 major / 3 minor

Summary. The paper introduces Deontic Simplicial Logic (DSL), a novel deontic logic interpreting simplicial complexes such that vertices represent individual agent commitments and higher-dimensional simplices represent joint group obligations. It extends the framework to Dynamic Deontic Simplicial Logic (DDSL) by defining update operations that model agents' choices among mutually exclusive commitments and the effects of individual and joint actions. Soundness and completeness are claimed for both the static and dynamic logics, motivated by examples in both settings.

Significance. If the claimed soundness and completeness results hold, the work supplies the first deontic reading of simplicial models and the first dynamic logic based on them. This could provide a geometrically grounded semantics for joint commitments that is distinct from standard Kripke or neighborhood models, with potential applications in multi-agent deontic reasoning. The explicit construction of update operations on simplicial complexes is a notable technical contribution.

minor comments (3)
  1. [Abstract] The abstract and introduction should explicitly state the language signature (propositional atoms, modalities, and any group operators) before presenting the semantics.
  2. Examples illustrating the update operations would benefit from a side-by-side comparison of the simplicial complex before and after the action to make the geometric effect of the update visually clear.
  3. Notation for the simplicial complex (e.g., the distinction between faces and the full complex) should be introduced once and used consistently; occasional shifts between set-theoretic and geometric descriptions can be confusing.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the paper, recognition of its potential significance as the first deontic interpretation of simplicial models and the first dynamic logic on them, and recommendation of minor revision. No specific major comments were listed in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper defines a novel DSL semantics on simplicial complexes (vertices as individual commitments, higher simplices as joint obligations) and extends it to DDSL with explicit update operations, then proves soundness and completeness. No equations reduce by construction to inputs, no parameters are fitted then relabeled as predictions, and no load-bearing steps rest on self-citations or imported uniqueness theorems. The construction is presented as original with motivating examples and formal proofs, making the derivation self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on a novel semantic interpretation of simplicial complexes together with standard background assumptions from modal and deontic logic; no free parameters or data-fitting are involved.

axioms (2)
  • standard math Background axioms and rules of deontic and modal logic
    The new logic extends existing deontic frameworks.
  • domain assumption Simplicial complexes admit a deontic reading where dimension corresponds to group size for obligations
    This is the core modeling choice stated in the abstract.
invented entities (1)
  • Deontic simplicial models no independent evidence
    purpose: Semantic structures for individual and joint commitments
    New interpretation introduced by the paper; no independent evidence outside the logic itself.

pith-pipeline@v0.9.1-grok · 5656 in / 1400 out tokens · 47554 ms · 2026-06-29T15:04:15.433165+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

35 extracted references · 18 canonical work pages

  1. [1]

    Moss, and Slawomir Solecki

    Alexandru Baltag, Lawrence S. Moss, and Slawomir Solecki. The logic of public announcements, common knowledge, and private suspicions. InProceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK ’98), Evanston, Illinois, 1998. Morgan Kaufmann

    1998

  2. [2]

    Cambridge University Press, 2005

    Cristina Bicchieri.The Grammar of Society: The Nature and Dynamics of Social Norms. Cambridge University Press, 2005

    2005

  3. [3]

    Bisimulation for impure simplicial complexes, 2024

    Marta B´ ılkov´ a, Hans van Ditmarsch, Roman Kuznets, and Rojo Randri- anomentsoa. Bisimulation for impure simplicial complexes, 2024. URL:https: //arxiv.org/abs/2406.16785,arXiv:2406.16785

    work page arXiv 2024

  4. [4]

    Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272).Dagstuhl Reports, 13(7):34–65, 2024

    Armando Casta˜ neda, Hans van Ditmarsch, Roman Kuznets, Yoram Moses, and Ulrich Schmid. Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272).Dagstuhl Reports, 13(7):34–65, 2024. URL:https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7. 34,doi:10.4230/DagRep.13.7.34

    work page doi:10.4230/dagrep.13.7 2024

  5. [5]

    Commitments: From individual intentions to groups and organizations

    Cristiano Castelfranchi. Commitments: From individual intentions to groups and organizations. InProc. of ICMAS, page 528–535. MIT press,, 1995

    1995

  6. [6]

    Logical formalization of social commitments: application to agent communication languages

    Benoit Gaudou, Andreas Herzig, and Dominique Longin. Logical formalization of social commitments: application to agent communication languages. InProceedings of The 8th International Conference on Autonomous Agents and Multiagent Sys- tems - Volume 2, AAMAS ’09, page 1293–1294, Richland, SC, 2009. International Foundation for Autonomous Agents and Multiag...

    2009

  7. [7]

    Routledge, 1989

    Margaret Gilbert.On Social Facts. Routledge, 1989

    1989

  8. [8]

    A Many-Sorted Epistemic Logic for Chromatic Hypergraphs

    ´Eric Goubault, Roman Kniazev, and J´ er´ emy Ledent. A Many-Sorted Epistemic Logic for Chromatic Hypergraphs. In Aniello Murano and Alexandra Silva, ed- itors,32nd EACSL Annual Conference on Computer Science Logic (CSL 2024), volume 288 ofLeibniz International Proceedings in Informatics (LIPIcs), pages 30:1–30:18, Dagstuhl, Germany, 2024. Schloss Dagstuh...

    work page doi:10.4230/lipics.csl.2024.30 2024

  9. [9]

    A simplicial complex model for dynamic epistemic logic to study distributed task computability.Information and Computation, 278, June 2021.doi:10.1016/j.ic.2020.104597

    ´Eric Goubault, J´ er´ emy Ledent, and Sergio Rajsbaum. A simplicial complex model for dynamic epistemic logic to study distributed task computability.Information and Computation, 278, June 2021.doi:10.1016/j.ic.2020.104597

    work page doi:10.1016/j.ic.2020.104597 2021

  10. [10]

    A Simplicial Model for KB4: Epistemic Logic with Agents That May Die

    ´Eric Goubault, J´ er´ emy Ledent, and Sergio Rajsbaum. A Simplicial Model for KB4: Epistemic Logic with Agents That May Die. In Petra Berenbrink and Ben- jamin Monmege, editors,39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), volume 219 ofLeibniz International Proceed- ings in Informatics (LIPIcs), pages 33:1–33:20, D...

    work page doi:10.4230/lipics.stacs.2022.33 2022

  11. [11]

    Semi- simplicial set models for distributed knowledge

    ´Eric Goubault, Roman Kniazev, J´ er´ emy Ledent, and Sergio Rajsbaum. Semi- simplicial set models for distributed knowledge. In2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–13, 2023.doi:10. 1109/LICS56636.2023.10175737

    work page arXiv 2023

  12. [12]

    Morgan Kaufmann, San Francisco, CA, 2014

    Maurice Herlihy, Dmitry Kozlov, and Sergio Rajsbaum.Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco, CA, 2014. doi:10.1016/C2011-0-07032-1

    work page doi:10.1016/c2011-0-07032-1 2014

  13. [13]

    The topological structure of asynchronous com- putability.Journal of the ACM, 46(6):858–923, 1999.doi:10.1145/331524

    Maurice Herlihy and Nir Shavit. The topological structure of asynchronous com- putability.Journal of the ACM, 46(6):858–923, 1999.doi:10.1145/331524. 331529. Dynamic Deontic Simplicial Logic 23

    work page doi:10.1145/331524 1999

  14. [14]

    Properties of logics of individ- ual and group agency

    Andreas Herzig and Fran¸ cois Schwarzentruber. Properties of logics of individ- ual and group agency. In Carlos Areces and Robert Goldblatt, editors,Ad- vances in Modal Logic, vol. 7 ; ISBN-13: 978-1904987680, volume 7, pages 133– 149, Nancy, France, September 2008. College Publications. URL:https://hal. science/hal-03526736

    2008

  15. [15]

    Horty.Agency and Deontic Logic

    John F. Horty.Agency and Deontic Logic. Oxford University Press, New York, 2001

    2001

  16. [16]

    Horty and Nuel Belnap

    John F. Horty and Nuel Belnap. The deliberative stit: A study of action, omission, ability, and obligation.Journal of Philosophical Logic, 24(6):583–644, 1995.doi: 10.1007/bf01306968

    work page doi:10.1007/bf01306968 1995

  17. [17]

    Moral conflicts between groups of agents.Journal of Philosophical Logic, 37(1):1–21, 2008.doi:10.1007/ s10992-007-9049-z

    Barteld Kooi and Allard Tamminga. Moral conflicts between groups of agents.Journal of Philosophical Logic, 37(1):1–21, 2008.doi:10.1007/ s10992-007-9049-z

    2008

  18. [18]

    A logical analysis of commitment dynamics

    Emiliano Lorini. A logical analysis of commitment dynamics. InProceedings of the 10th International Conference on Deontic Logic in Computer Science, DEON’10, page 288–305, Berlin, Heidelberg, 2010. Springer-Verlag

    2010

  19. [19]

    Meyer, W

    J.-J.Ch. Meyer, W. van der Hoek, and B. van Linder. A logical approach to the dynamics of commitments.Artificial Intelligence, 113(1):1–40, 1999. URL:https: //www.sciencedirect.com/science/article/pii/S0004370299000612,doi:10. 1016/S0004-3702(99)00061-2

    1999

  20. [20]

    Rosenblueth, and Diego A

    Armando Casta neda, Hans van Ditmarsch, David A. Rosenblueth, and Diego A. Vel´ azquez. Communication pattern logic: Epistemic and topological views.Journal of Philosophical Logic, 52(5):1445–1473, 2023.doi:10.1007/s10992-023-09713-8

    work page doi:10.1007/s10992-023-09713-8 2023

  21. [21]

    Logics of public communications.Synthese, 158(2):165–179, September

    Jan Plaza. Logics of public communications.Synthese, 158(2):165–179, September

  22. [22]

    Originally published in 1989.doi:10.1007/s11229-007-9168-7

    work page doi:10.1007/s11229-007-9168-7 1989

  23. [23]

    Impure sim- plicial complexes: Complete axiomatization.Logical Methods in Computer Science, 19(4):3:1–3:35, 2023.doi:10.48550/arXiv.2211.13543

    Rojo Randrianomentsoa, Hans van Ditmarsch, and Roman Kuznets. Impure sim- plicial complexes: Complete axiomatization.Logical Methods in Computer Science, 19(4):3:1–3:35, 2023.doi:10.48550/arXiv.2211.13543

    work page doi:10.48550/arxiv.2211.13543 2023

  24. [24]

    The Logic of Action

    Krister Segerberg, John-Jules Meyer, and Marcus Kracht. The Logic of Action. In Edward N. Zalta and Uri Nodelman, editors,The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Summer 2024 edition, 2024

    2024

  25. [25]

    Deontic logic for strategic games.Erkenntnis, 78(1):183–200, 2013.doi:10.1007/s10670-011-9349-0

    Allard Tamminga. Deontic logic for strategic games.Erkenntnis, 78(1):183–200, 2013.doi:10.1007/s10670-011-9349-0

    work page doi:10.1007/s10670-011-9349-0 2013

  26. [26]

    Collective obligations, group plans and in- dividual actions.Economics and Philosophy, 33(2):187–214, July 2017.doi: 10.1017/S0266267116000213

    Allard Tamminga and Hein Duijf. Collective obligations, group plans and in- dividual actions.Economics and Philosophy, 33(2):187–214, July 2017.doi: 10.1017/S0266267116000213

    work page doi:10.1017/s0266267116000213 2017

  27. [27]

    Expressivity results for deontic logics of collective agency.Synthese, 198(9):8733–8753, 2021.doi: 10.1007/s11229-020-02597-0

    Allard Tamminga, Hein Duijf, and Frederik Van De Putte. Expressivity results for deontic logics of collective agency.Synthese, 198(9):8733–8753, 2021.doi: 10.1007/s11229-020-02597-0

    work page doi:10.1007/s11229-020-02597-0 2021

  28. [28]

    The irreducibility of collective obligations.Philosophical Studies, 177(4):1085–1109, 2020.doi:10.1007/ s11098-018-01236-2

    Allard Tamminga and Frank Hindriks. The irreducibility of collective obligations.Philosophical Studies, 177(4):1085–1109, 2020.doi:10.1007/ s11098-018-01236-2

    2020

  29. [29]

    Oxford University Press, United Kingdom, 2007

    Raimo Tuomela.The philosophy of sociality: the shared point of view. Oxford University Press, United Kingdom, 2007

    2007

  30. [30]

    van Ditmarsch, J.Y

    H. van Ditmarsch, J.Y. Halpern, W. van der Hoek, and B.P. Kooi.Handbook of Epistemic Logic. College Publications, 2015

    2015

  31. [31]

    Springer, May 2022.doi:10.1007/978-3-030-75267-5\_1

    Hans van Ditmarsch, ´Eric Goubault, J´ er´ emy Ledent, and Sergio Rajsbaum.Knowl- edge and simplicial complexes, volume 143 ofPhilosophical Studies Series, pages 1–50. Springer, May 2022.doi:10.1007/978-3-030-75267-5\_1. 24 G. Cignarale, H. Rincon Galeana

    work page doi:10.1007/978-3-030-75267-5 2022

  32. [32]

    Wanted dead or alive: epistemic logic for impure simplicial complexes.Journal of Logic and Computation, 35(6):31–46, 10 2024.doi:10.1093/logcom/exae055

    Hans van Ditmarsch and Roman Kuznets. Wanted dead or alive: epistemic logic for impure simplicial complexes.Journal of Logic and Computation, 35(6):31–46, 10 2024.doi:10.1093/logcom/exae055

    work page doi:10.1093/logcom/exae055 2024

  33. [33]

    On two- and three-valued semantics for impure simplicial complexes

    Hans van Ditmarsch, Roman Kuznets, and Rojo Randrianomentsoa. On two- and three-valued semantics for impure simplicial complexes. InInternational Symposium on Games, Automata, Logics and Formal Verification, 2023. URL: https://api.semanticscholar.org/CorpusID:263285073

    2023

  34. [34]

    Springer, 2007.doi:10.1007/ 978-1-4020-5839-4

    Hans van Ditmarsch, Wiebe van der Hoek, and Barteld Kooi.Dynamic Epis- temic Logic, volume 337 ofSynthese Library. Springer, 2007.doi:10.1007/ 978-1-4020-5839-4

    2007

  35. [35]

    Hans van Ditmarsch, ´Eric Goubault, Marijana Lazi´ c, J´ er´ emy Ledent, and Sergio Rajsbaum. A dynamic epistemic logic analysis of equality negation and other epis- temic covering tasks.Journal of Logical and Algebraic Methods in Programming, 121:100662, 2021.doi:10.1016/j.jlamp.2021.100662

    work page doi:10.1016/j.jlamp.2021.100662 2021