Abstract
In the literature we find two concepts of “termination”. We shall call them “weak” and “strong” termination respectively. They are equivalent within the realm of continuous functions, but different in the presence of unbounded nondeterminacy. It will be shown that in the realm of continuous functions the generality of (infinite) well-founded sets is of no essential use for proofs of termination, as partially ordered finite sets will do just as nicely.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
Dijkstra, Edsger W. [ 1976 ] A Discipline of Programming, Prentice-Hall, Englewood Cliffs, NJ, U.S.A.
Floyd, R.W. [ 1967 ] “Assigning Meanings to Programs”. Proc. Symp. in Applied Mathematics, vol. 19 ( J.T. Schwartz, ed.), American Mathematical Society, Providence, RI, U.S.A.
Rights and permissions
Copyright information
© 1982 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Dijkstra, E.W. (1982). On Weak and Strong Termination. In: Selected Writings on Computing: A personal Perspective. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5695-3_64
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5695-3_64
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-5697-7
Online ISBN: 978-1-4612-5695-3
eBook Packages: Springer Book Archive