Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Newman’s_lemma
|
| gptkbp:appliesTo |
abstract reduction systems
|
| gptkbp:citation |
Bergman’s diamond lemma
|
| gptkbp:field |
abstract algebra
rewriting systems universal algebra |
| gptkbp:generalizes |
diamond property
|
| https://www.w3.org/2000/01/rdf-schema#label |
Newman’s diamond lemma
|
| gptkbp:namedAfter |
gptkb:M._H._A._Newman
|
| gptkbp:publicationYear |
1942
|
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Church–Rosser_property
confluence termination local confluence |
| gptkbp:sentence |
A terminating rewriting system is confluent if and only if it is locally confluent.
|
| gptkbp:usedIn |
computer science
proof theory algebraic structures term rewriting |
| gptkbp:bfsParent |
gptkb:Newman’s_lemma
|
| gptkbp:bfsLayer |
7
|