{
  "id": "1511.02935",
  "version": "v1",
  "published": "2015-11-09T23:49:17.000Z",
  "updated": "2015-11-09T23:49:17.000Z",
  "title": "Hanf Numbers and Presentation Theorems in AECs",
  "authors": [
    "Will Boney",
    "John Baldwin"
  ],
  "categories": [
    "math.LO"
  ],
  "abstract": "We prove that a strongly compact cardinal is an upper bound for a Hanf number for amalgamation, etc. in AECs using both semantic and syntactic methods. To syntactically prove non-disjoint amalgamation, a different presentation theorem than Shelah's is needed. This relational presentation theorem has the added advantage of being {\\it functorial}, which allows the transfer of amalgamation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-11-09T23:49:17.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hanf number",
      "relational presentation theorem",
      "upper bound",
      "syntactic methods",
      "non-disjoint amalgamation"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv151102935B"
    }
  }
}