Newman's lemma
id:
newman-s-lemma-285-17897073
title:
Newman's lemma
text:
In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating abstract rewriting system (ARS), that is, one in which there are no infinite reduction sequences, is confluent if it is locally confluent. In fact a terminating ARS is confluent precisely when it is locally confluent. Equivalently, for every binary relation with no decreasing infinite chains and satisfying a weak version of the diamond property, there is a unique
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Newman%27s_lemma
date created:
date modified:
2024-03-01T13:34:24Z
main entity:
{"identifier":"Q1208706","url":"https://www.wikidata.org/entity/Q1208706"}
image:
fields total:
13
integrity:
13