Convergence (logic)

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.{{cite book|author1=Franz Baader|author-link=Franz Baader|author2=Tobias Nipkow|author2-link=Tobias Nipkow|title=Term Rewriting and All That|year=1998|publisher=Cambridge University Press|isbn=0-521-77920-0}}

See also

References

{{Reflist}}

Category:Rewriting systems

{{mathlogic-stub}}

{{plt-stub}}