| Display title | Newman's lemma |
| Default sort key | Newman's lemma |
| Page length (in bytes) | 5,373 |
| Namespace ID | 0 |
| Page ID | 223870 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Rtexter1 |
| Date of page creation | 09:31, 3 August 2023 |
| Latest editor | imported>Rtexter1 |
| Date of latest edit | 09:31, 3 August 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating (or strongly normalizing) abstract rewriting system (ARS), that is, one in which there are no infinite reduction sequences, is confluent if it is locally confluent. In... |
