{
  "id": "1707.04660",
  "version": "v1",
  "published": "2017-07-14T23:10:24.000Z",
  "updated": "2017-07-14T23:10:24.000Z",
  "title": "The classification of countable models of set theory",
  "authors": [
    "John Clemens",
    "Samuel Coskey",
    "Samuel Dworetzky"
  ],
  "categories": [
    "math.LO"
  ],
  "abstract": "We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be. We then give partial results concerning the classification of countable well-founded models of ZFC.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-07-14T23:10:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03E15",
      "03C62"
    ],
    "keywords": [
      "set theory",
      "arbitrary countable models",
      "borel complete",
      "classification problem",
      "complexity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}