Bounds to Memory Loss

Theory and Decision 46 (1):1-21 (1999)
  Copy   BIBTEX

Abstract

If we express our knowledge in sentences, we will find that these sentences are linked in complex patterns governed by our observations and our inferences from these observations. These inferences are to a large extent driven by logical rules. We ask whether the structure logic imposes on our knowledge restricts what we forget and what we remember. The model is a two period S5 logic. In this logic, we propose a memory loss operator: the agent forgets a sentence pif and only if he knows pat time 1 and he does not know pat time 2. Equipped with the operator, we prove theorems on the relation between knowledge and memory loss. The main results point to classes of formulas that an agent cannot forget, and classes of formulas he must forget. A desirable feature is that most results hold in the S4 logic. The results illustrate bounds to memory loss, and thus to bounded rationality. We apply the model to single-agent conventions: conventions made between an agent and himself

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,619

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-09-02

Downloads
74 (#276,697)

6 months
7 (#655,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations