Impure Simplicial Complex and Term-Modal Logic with Assignment Operators

Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many conceptually dubious expressions involving dead agents can be expressed in this language.In this paper, we introduce a term-modal language with assignment operators, in which such conceptually dubious expressions are syntactically excluded.We define both simplicial semantics and first-order Kripke semantics for this language, characterize their respective expressivity through notions of bisimulation, and show that the two semantics are equivalent when we consider a special class of first-order Kripke models called local epistemic models.We also offer a complete axiomatization for the epistemic logic based on this language, and show that our language has a notion of assignment normal form.Finally, we discuss the behavior of a kind of intensional distributed knowledge that can be naturally expressed in our language.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2025-11-25
DOI
https://doi.org/10.4204/eptcs.437.31
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Impure Simplicial Complex and Term-Modal Logic with Assignment Operators

Yuanzhe Yang
Electronic Proceedings in Theoretical Computer Science
Logic, Reasoning, and Knowledge
article

Impure Simplicial Complex and Term-Modal Logic with Assignment Operators

Yuanzhe Yang
article en

Abstract

Impure simplicial complexes are a powerful tool to model multi-agent epistemic situations where agents may die, but it is difficult to define a satisfactory semantics for the ordinary propositional modal language on such models, since many conceptually dubious expressions involving dead agents can be expressed in this language.In this paper, we introduce a term-modal language with assignment operators, in which such conceptually dubious expressions are syntactically excluded.We define both simplicial semantics and first-order Kripke semantics for this language, characterize their respective expressivity through notions of bisimulation, and show that the two semantics are equivalent when we consider a special class of first-order Kripke models called local epistemic models.We also offer a complete axiomatization for the epistemic logic based on this language, and show that our language has a notion of assignment normal form.Finally, we discuss the behavior of a kind of intensional distributed knowledge that can be naturally expressed in our language.

Electronic Proceedings in Theoretical Computer ScienceVol. 437
Peking University (CN)
Openalex Percentile: Top 81%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Impure Simplicial Complex and Term-Modal Logic with Assignment Operators — Yuanzhe Yang · Electronic Proceedings in Theoretical Computer Science (2025) | TGRS Research Map | TGRS