Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Newman's_diamond_lemma
|
| gptkbp:appliesTo |
abstract rewriting systems
|
| gptkbp:field |
gptkb:logic
rewriting systems |
| https://www.w3.org/2000/01/rdf-schema#label |
Newman's lemma
|
| gptkbp:importantFor |
fundamental result in term rewriting theory
|
| gptkbp:namedAfter |
gptkb:M._H._A._Newman
|
| gptkbp:publicationYear |
1942
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_Cambridge_Philosophical_Society
|
| gptkbp:relatedConcept |
gptkb:Church–Rosser_property
confluence termination local confluence |
| gptkbp:state |
If a terminating rewriting system is locally confluent, then it is confluent.
|
| gptkbp:bfsParent |
gptkb:M._H._A._Newman
|
| gptkbp:bfsLayer |
6
|