Abstract
The transitive closure of relation R is defined as the strongest relation S that satisfies for all x,y (in the domain of R) $$\rm xSy \eq xRy \vee ({\b E}z: zRy: xSz).$$
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Gasteren, A.J.M., Dijkstra, E.W. (1992). Well-foundedness and the transitive closure. In: Broy, M. (eds) Programming and Mathematical Method. NATO ASI Series, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77572-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-77572-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77574-1
Online ISBN: 978-3-642-77572-7
eBook Packages: Springer Book Archive