Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03434379n
Noun Named Entity
EL
No term available
EN
In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating abstract rewriting system, that is, one in which there are no infinite reduction sequences, is confluent if it is locally confluent. Wikipedia
Relations
Sources
IS A
EN
lemma
NAMED AFTER
Max Newman

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License