LP-1998-09: Areces, Carlos and Becher, Verónica (1998) Iterable AGM Functions. [Report]
![[thumbnail of Full Text]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Full Text)
LP-1998-09.text.ps.gz Download (107kB) |
|
Text (Abstract)
LP-1998-09.abstract.txt Download (753B) |
Abstract
The AGM model has been criticized for not addressing the problem
of iterated change. This is true, but in some cases the invalid claim
that "AGM does not allow iteration" has been made. In this paper we
examine the most elementary scheme of iteration: an iterable function.
We formulate an iterable version of the AGM model, showing that
the AGM formalism is in fact compatible with iteration. Following
Alchourr\'on and Makinson's early reference to an iterable form of a
safe contraction function, we give an iterable construction for each
of the five AGM presentations (meet functions, systems of spheres,
postulates, epistemic entrenchments and safe hierarchies) and prove
their equivalence.
| Item Type: | Report |
|---|---|
| Report Nr: | LP-1998-09 |
| Series Name: | Logic, Philosophy and Linguistics (LP) |
| Year: | 1998 |
| Date Deposited: | 12 Oct 2016 14:40 |
| Last Modified: | 12 Oct 2016 14:40 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1269 |
Actions (login required)
 |
View Item |
