Statements (12)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Newman’s_diamond_lemma
|
| gptkbp:appliesTo |
abstract rewriting systems
|
| gptkbp:field |
gptkb:mathematics
rewriting systems |
| https://www.w3.org/2000/01/rdf-schema#label |
Newman’s lemma
|
| gptkbp:namedAfter |
gptkb:M._H._A._Newman
|
| gptkbp:publicationYear |
1942
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Cambridge_Philosophical_Society
|
| gptkbp:state |
A terminating rewriting system is confluent if and only if it is locally confluent.
|
| gptkbp:bfsParent |
gptkb:Max_Newman
|
| gptkbp:bfsLayer |
6
|