Agreement theorems in dynamic-epistemic logic (Q692182): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/jphil/DegremontR12, #quickstatements; #temporary_batch_1731475607626
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10992-012-9236-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044256927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agreeing to disagree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some extensions of a claim of Aumann in an axiomatic model of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Logic of Public Announcements, Common Knowledge, and Private Suspicions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Doxastic Models: A Qualitative Approach to Dynamic Belief Revision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning by Questions and Answers: From Belief-Revision Cycles to Doxastic Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic logic for belief revision / rank
 
Normal rank
Property / cites work
 
Property / cites work: ERRATUM: "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic interactive epistemology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le théorème de Zorn / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation for extended modal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to agree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Epistemic Logic and Knowledge Puzzles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: We can't disagree forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating common knowledge with common beliefs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agreeing to disagree: the non-probabilistic case / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jphil/DegremontR12 / rank
 
Normal rank

Latest revision as of 06:35, 13 November 2024

scientific article
Language Label Description Also known as
English
Agreement theorems in dynamic-epistemic logic
scientific article

    Statements

    Agreement theorems in dynamic-epistemic logic (English)
    0 references
    0 references
    0 references
    4 December 2012
    0 references
    This paper introduces the idea of agreement theorems, which originate with the work of Robert Aumann, and shows how they can be represented in a dynamic epistemic logic setting. Aumann's result was that, if agents have common prior beliefs, then differences in their posterior beliefs cannot be common knowledge. Since the concepts of belief and knowledge, and in particular higher-order belief and knowledge, are central to dynamic epistemic logic, it seems natural to represent agreement theorems in this context. The authors first show how an agreement theorem can be represented in the context of a static epistemic plausibility model. They prove the result that (in a well-founded model) a common belief that agents disagree on the truth of a formula implies that these agents have different prior beliefs. To express the concepts involved in the agreement theorems, however, a more expressive language than that of epistemic-doxastic logic is required. The authors show that epistemic-doxastic logic is insufficient for expressing well-foundedness and common priors, but that a hybrid logic does have sufficient expressive power. This enables them to give a syntactic proof of the agreement theorem in this latter setting. The last section of the paper considers the possibility of agents reaching agreement under different kinds of dynamic updates. They consider two different types of dynamic processes that enable agents to update their informational states: conditioning and public announcements. Both of these can be thought of as dialogues of a kind, in which agents exchange information about each others' beliefs. The main difference is in the publicity of those exchanges. In belief conditioning, agents revise their beliefs conditional upon what they learn about other agents' beliefs. But there is no assumption that agents are aware of each others' updating processes. On the other hand, in the case of public announcements, the assumption is that all agents in the group are aware that the information received is truthful, and received as such by all other agents. The consequence of this difference is that the truth value of a publicly announced formula can change its truth value as a result of the announcement. Thus even though both types of dialogue will eventually lead to a fixed point, the agreements reached may differ.
    0 references
    0 references
    agreement theorems
    0 references
    dynamic-epistemic logic
    0 references
    information
    0 references
    belief revision
    0 references
    fixed-point logic
    0 references
    hybrid logic
    0 references

    Identifiers