I'm OK if you're OK: On the notion of trusting commmunication

DOI10.1007/BF00297510MaRDI QIDQ1114430zbMATH OpenOpenAlexFDO

Authors Ronald Fagin, Joseph Y. Halpern

Publication date 1988

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00297510

zbMATH Keywords

cooperative communication in distributed systemsnatural language understandingreasoning about knowledge

Mathematics Subject Classification ID

Theory of operating systems (68N25) Artificial intelligence (68T99)

Review text

We consider the issue of what an agent or a processor needs to know in order to know that its messages are true. This may be viewed 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 considerations then honesty are investigated with the property that provided every message sent satisfies the condition, then every message sent is true.

Recommendations

• The semantics of untrustworthiness
• Trust and agency in the context of communication
• scientific article; zbMATH DE number 1954129
• scientific article; zbMATH DE number 3930375
• Knowledge and common knowledge in a distributed environment

Cites work

• Belief, awareness, and limited reasoning
• How processes learn
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Outline of a Theory of Truth
• Programming simultaneous actions using common knowledge

Cited in

(2)

• The semantics of untrustworthiness
• Guest editors' introduction

This page was built for publication: I'm OK if you're OK: On the notion of trusting commmunication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114430)