{
  "aliases": [
    "all-horses-are-the-same-colour",
    "equine-monochromaticity-theorem",
    "horse-paradox"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\n**All horses are the same color** is a paradox that arises from a flawed use of [[mathematical induction|0ASJVEFA9J]] to prove the statement *All horses are the same color*. There is no actual contradiction, as these arguments have a crucial flaw that makes them incorrect. This example was originally raised by George Pólya in a 1954 book in different terms: \"Are any $n$ numbers equal?\" or \"Any $n$ girls have eyes of the same color\", as an exercise in mathematical induction. It has also been restated as \"All cows have the same color\".\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "all-horses-are-the-same-colour",
      "equine-monochromaticity-theorem",
      "horse-paradox"
    ],
    "inventory": [
      "VJPD9EGWGZ"
    ],
    "kind": "concept",
    "name": "All horses are the same color",
    "same_as": {
      "wikidata": "Q1091396",
      "wikipedia": "All horses are the same color"
    },
    "sources": [
      {
        "locator": "All horses are the same color",
        "mention": "wikipedia://en/151912",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:151912@r1369976011"
      }
    ],
    "tag": "AJ2FDJJGTH"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/AJ2FDJJGTH/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/AJ2FDJJGTH.md",
  "msc": null,
  "name": "All horses are the same color",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/AJ2/AJ2FDJJGTH.md",
  "status": null,
  "tag": "AJ2FDJJGTH",
  "uri": "m2://AJ2FDJJGTH",
  "url": "https://math2.tamnd.com/wiki/all-horses-are-the-same-color/",
  "writing": {
    "tag": "AJ2FDJJGTH",
    "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
      }
    ]
  }
}