{
  "annotation_id": "f5ca7f6e-56f9-4953-b6ce-2da528115f5e",
  "date_created": "2026-02-17T05:53:24.392000Z",
  "date_modified": "2026-02-17T05:53:24.392000Z",
  "file_hash": "88cb961914f3c8a2a0df067f95437481cadb47f7a51923c646bf85c65b6fe5fe",
  "private": false,
  "record": {
    "abstract": "In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic: the class of free monoids is not first-order axiomatizable, so \"working in the free setting\" cannot be treated internally when applying first-order methods to rewriting presentations.\n  To analyze these systems categorically, we define $\\mathbf{NCRS_2}$ as the 2-category of Noetherian Confluent MRS. We then prove the existence of a canonical biadjunction between $\\mathbf{NCRS_2}$ and $\\mathbf{Mon}$.\n  Finally, we classify all Noetherian Confluent MRS that present a given fixed monoid. For this, we introduce Generalized Elementary Tietze Transformations (GETTs) and prove that any two presentations of a monoid are connected by a (possibly infinite) sequence of these transformations, yielding a complete characterization of generating systems up to GETT-equivalence.",
    "arxiv_id": "2601.10564",
    "authors": [
      "Eduardo Magalh\u00e3es"
    ],
    "categories": [
      "cs.FL",
      "cs.LO",
      "math.CT"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Rewriting Systems on Arbitrary Monoids",
    "url": "https://arxiv.org/abs/2601.10564",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ff3a1e93-0de5-401f-9fed-4290e235f3ad",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}