Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03434379n
Noun Named Entity
Categories: Lemmas, Wellfoundedness, Rewriting systems
EN
Newman's lemma  diamond lemma  diamond property  Newman lemma
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
Definitions
Relations
Sources
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
Lemma Wikidata
IS A
lemma
NAMED AFTER
Max Newman
Wikipedia
EN
Newman's lemma
Wikidata
EN
Newman's lemma
Wikipedia Redirections
EN
diamond lemma, diamond property, Newman's Lemma, Newman lemma
Wikidata Alias
EN
diamond lemma

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