I'm OK if you're OK: On the notion of trusting commmunication (Q1114430)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: I'm OK if you're OK: On the notion of trusting commmunication |
scientific article; zbMATH DE number 4083021
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I'm OK if you're OK: On the notion of trusting commmunication |
scientific article; zbMATH DE number 4083021 |
Statements
I'm OK if you're OK: On the notion of trusting commmunication (English)
0 references
1988
0 references
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.
0 references
natural language understanding
0 references
reasoning about knowledge
0 references
cooperative communication in distributed systems
0 references
0.7075614929199219
0 references
0.6740030646324158
0 references