Bounds to Memory Loss
If we express our knowledge in sentences, we will find that these sentences to some extent are linked 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-style modal logic. In this logic we propose a memory loss operator: The agent forgets a sentence p if and only if he knows p at time 1 and he does not know p at 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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
| Length: | 22 pages |
| Date of creation: | 1999 |
| Handle: | RePEc:fth:teavfo:11-99 |
| Contact details of provider: | Postal: Israel TEL-AVIV UNIVERSITY, THE FOERDER INSTITUTE FOR ECONOMIC RESEARCH, RAMAT AVIV 69 978 TEL AVIV ISRAEL. Phone: 972-3-640-9255 Fax: 972-3-640-5815 Web page: http://econ.tau.ac.il/foerder/about Email: More information through EDIRC
|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Barton L. Lipman, 1995.
"Information Processing and Bounded Rationality: A Survey,"
Canadian Journal of Economics,
Canadian Economics Association, vol. 28(1), pages 42-67, February.
- Barton L. Lipman, 1993. "Information Processing and Bounded Rationality: A Survey," Working Papers 872, Queen's University, Department of Economics.
- Ronald Fagin & Joseph Y. Halpern & Yoram Moses & Moshe Y. Vardi, 2003. "Reasoning About Knowledge," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262562006, July.
- James Dow, 1991. "Search Decisions with Limited Memory," Review of Economic Studies, Oxford University Press, vol. 58(1), pages 1-14.
- Battigalli, Pierpaolo & Bonanno, Giacomo, 1997. "The Logic of Belief Persistence," Economics and Philosophy, Cambridge University Press, vol. 13(01), pages 39-59, April.
- Giacomo Bonanno & Pierpaolo Battigalli, 2004. "The Logic Of Belief Persistency," Working Papers 9518, University of California, Davis, Department of Economics.
- Hvide, H.K., 1997. "SElf-Awareness, Uncertainty, and Markets with Overconfidence," Papers 9/97, Norwegian School of Economics and Business Administration-.
- Modica, Salvatore & Rustichini, Aldo, 1999. "Unawareness and Partitional Information Structures," Games and Economic Behavior, Elsevier, vol. 27(2), pages 265-298, May. Full references (including those not matched with items on IDEAS)
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:fth:teavfo:11-99. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.