A reduction system is said to posses the Church-Rosser property if, for all and such that , there exists a such that and .
Church-Rosser Property
See also
Church-Rosser Theorem, Confluent, Critical Pair, Finitely Terminating, Knuth-Bendix Completion Algorithm, Reduction OrderThis entry contributed by Alex Sakharov (author's link)
Explore with Wolfram|Alpha
References
Baader, F. and Nipkow, T. Term Rewriting and All That. Cambridge, England: Cambridge University Press, 1999.Wolfram, S. A New Kind of Science. Champaign, IL: Wolfram Media, pp. 507 and 1036-1037, 2002.Referenced on Wolfram|Alpha
Church-Rosser PropertyCite this as:
Sakharov, Alex. "Church-Rosser Property." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/Church-RosserProperty.html