Establishes analytic cut property for sequent calculi of epistemic logics with distributed knowledge on K45, KD45, and S5 bases, yielding Craig interpolation as corollary.
Halpern & Moshe Y
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Develops a probabilistic epistemic logic framework for bounded-round randomized distributed algorithms and applies it to formally analyze and strengthen the lower bound of the Varghese-Lynch randomized coordinated attack algorithm.
citing papers explorer
-
An Epistemic Analysis of Random Coordinated Attack
Develops a probabilistic epistemic logic framework for bounded-round randomized distributed algorithms and applies it to formally analyze and strengthen the lower bound of the Varghese-Lynch randomized coordinated attack algorithm.