{
  "aliases": [
    "well-ordering",
    "well-ordered-set"
  ],
  "backlinks": [
    {
      "field": "defines",
      "target": "0F1D6PK9RZ"
    },
    {
      "field": "specializes",
      "target": "0HNATXFEV5"
    }
  ],
  "body": "\n## Summary\n\nA well-order is a total order in which each nonempty subset has a least element.\n",
  "commit": "c92b8e2dba4d0d44b1b804f2f3576a4d2506ba69",
  "front": {
    "aliases": [
      "well-ordering",
      "well-ordered-set"
    ],
    "inventory": [
      "WPN6VNJ0WP"
    ],
    "kind": "concept",
    "msc": [
      "06A05"
    ],
    "name": "Well-order",
    "same_as": {
      "wikidata": "Q659746",
      "wikipedia": "Well-order"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Well-order"
      }
    ],
    "specializes": [
      "0FRXBVVR03"
    ],
    "tag": "01CGSJ0GNQ"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/01CGSJ0GNQ/",
  "links": [
    {
      "field": "specializes",
      "target": "0FRXBVVR03"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/01CGSJ0GNQ.md",
  "msc": [
    "06A05"
  ],
  "name": "Well-order",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/01C/01CGSJ0GNQ.md",
  "status": null,
  "tag": "01CGSJ0GNQ",
  "uri": "m2://01CGSJ0GNQ",
  "url": "https://math2.tamnd.com/wiki/well-order/",
  "writing": {
    "tag": "01CGSJ0GNQ",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "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
      }
    ]
  }
}