In mathematics, computer science and logic, convergence is the idea that different sequences of transformations come to a conclusion in a finite amount of time (the transformations are terminating), and that the conclusion reached is independent of the path taken to get to it (they are confluent).
More formally, a preordered set of term rewriting transformations are said to be convergent if they are confluent and terminating.
We don't have any images related to Convergence (logic) yet.
You can add one yourself here.
We don't have any YouTube videos related to Convergence (logic) yet.
You can add one yourself here.
We don't have any PDF documents related to Convergence (logic) yet.
You can add one yourself here.
We don't have any Books related to Convergence (logic) yet.
You can add one yourself here.
We don't have any archived web articles related to Convergence (logic) yet.
See also
References
Franz Baader; Tobias Nipkow (1998). Term Rewriting and All That. Cambridge University Press. ISBN 0-521-77920-0. 0-521-77920-0 ↩