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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Dijkstra, Edsger W. [ 1976 ] A Discipline of Programming, Prentice-Hall, Englewood Cliffs, NJ, U.S.A.Google Scholar
  2. 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.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1982

Authors and Affiliations

  • Edsger W. Dijkstra

There are no affiliations available

Personalised recommendations