Convergence (logic)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, computer science and logic, convergence refers to 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.[1]

See also[edit]


  1. ^ Franz Baader; Tobias Nipkow (1998). Term Rewriting and All That. Cambridge University Press. ISBN 0-521-77920-0.