Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
The authors consider the issue of what an agent or a processor needs to know in order to know that its messages are true. They view this as a first step to a general theory of cooperative communication in distributed systems. An honest message is one that is known to be true when it is sent (or said). If every message that is sent is honest, then of course every message that is sent is true. Various weaker conditions than honesty are investigated with the property that, provided every message sent satisfies the condition, then every message sent is true.
Joseph Y. Halpern
aaai 1996
Joseph Y. Halpern
aaai 1993
Moshe Y. Vardi, Pierre Wolper
LICS 1986
Joseph Y. Halpern, Yoram Moses, et al.
PODC 1990