{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nFriedman, Robertson \u0026 Seymour (1987) showed that the following theorem exhibits the independence phenomenon by being *unprovable* in various formal systems that are much stronger than Peano arithmetic, yet being *provable* in systems much weaker than ZFC:\n\n(Here, the *size* of a graph is the total number of its vertices and edges, and ≤ denotes the minor ordering.)\n\nFriedman uses this result on simple subcubic graphs to construct the fast-growing function, SSCG.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "1GJ2V5WMKQ"
    ],
    "kind": "statement",
    "name": "Finite form of the graph minor theorem",
    "role": "theorem",
    "sources": [
      {
        "locator": "Robertson–Seymour theorem, section Finite form of the graph minor theorem",
        "mention": "wikipedia://en/351769#K9TO",
        "note": "adopted",
        "sections": [
          "Statement"
        ],
        "wikipedia": "en:351769@r1361823548"
      }
    ],
    "tag": "WXNTPQGJ38"
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/WXNTPQGJ38/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/WXNTPQGJ38.md",
  "msc": null,
  "name": "Finite form of the graph minor theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/WXN/WXNTPQGJ38.md",
  "status": null,
  "tag": "WXNTPQGJ38",
  "uri": "m2://WXNTPQGJ38",
  "url": "https://math2.tamnd.com/wiki/finite-form-of-the-graph-minor-theorem/",
  "writing": {
    "tag": "WXNTPQGJ38",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "edge uses out",
        "note": "each definition that the statement needs",
        "have": 0,
        "want": 1
      }
    ]
  }
}