Abstract
Imagine that we have an infinite number of boxes labelled 0, 1, 2,.... In the boxes there are a finite number of pebbles. Now start the following process. At each stage you are allowed to remove one pebble from a box with label n and then replace it with as many pebbles as you like as long as those pebbles are introduced in boxes with lower labels than n. A stage in the process can be visualized by
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feferman, S., System of Predicative Analysis II: Representation of Ordinals, JSL Vol. 33, 1968.
Girard, J.-Y., ‘III-logic. Part 1: Dilators’, Ann. Math. Logic, 21 (1981).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Jervell, H.R. (1999). Dynamic Datastructures. In: Cantini, A., Casari, E., Minari, P. (eds) Logic and Foundations of Mathematics. Synthese Library, vol 280. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2109-7_18
Download citation
DOI: https://doi.org/10.1007/978-94-017-2109-7_18
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5201-8
Online ISBN: 978-94-017-2109-7
eBook Packages: Springer Book Archive