Introduces simplicial secrecy models and primitive secrecy operator S_a φ with sound axiomatization SSL and completeness proof via canonical models for multi-agent cases.
Moss and Rohit Parikh
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
A Logic of Secrecy on Simplicial Models
Introduces simplicial secrecy models and primitive secrecy operator S_a φ with sound axiomatization SSL and completeness proof via canonical models for multi-agent cases.