{
  "aliases": [
    "kleene-brouwer-ordering"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn descriptive set theory, the **Kleene–Brouwer order** or **Lusin–Sierpiński order** is a linear order on finite sequences over some linearly ordered set $(X, \u003c)$, that differs from the more commonly used [[lexicographic order|0B68KNPGCG]] in how it handles the case when one sequence is a prefix of the other. In the Kleene–Brouwer order, the prefix is later than the longer sequence containing it, rather than earlier.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "kleene-brouwer-ordering"
    ],
    "inventory": [
      "KATCW64K2G"
    ],
    "kind": "concept",
    "name": "Kleene–Brouwer order",
    "same_as": {
      "wikidata": "Q6420094",
      "wikipedia": "Kleene–Brouwer order"
    },
    "sources": [
      {
        "locator": "Kleene–Brouwer order",
        "mention": "wikipedia://en/9042378",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:9042378@r1058700184"
      }
    ],
    "tag": "XK3W91QNPC"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/XK3W91QNPC/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/XK3W91QNPC.md",
  "msc": null,
  "name": "Kleene–Brouwer order",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/XK3/XK3W91QNPC.md",
  "status": null,
  "tag": "XK3W91QNPC",
  "uri": "m2://XK3W91QNPC",
  "url": "https://math2.tamnd.com/wiki/kleene-brouwer-order/",
  "writing": {
    "tag": "XK3W91QNPC",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}