{
  "id": "math/9706206",
  "version": "v1",
  "published": "1997-06-12T00:00:00.000Z",
  "updated": "1997-06-12T00:00:00.000Z",
  "title": "A definability theorem for first order logic",
  "authors": [
    "Carsten Butz",
    "Ieke Moerdijk"
  ],
  "categories": [
    "math.LO"
  ],
  "abstract": "For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order formula. Our presentation is entirely selfcontained, and only requires familiarity with the most elementary properties of model theory.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1997-06-12T00:00:00.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "first order logic",
      "definability theorem",
      "first order theory",
      "first order formula",
      "elementary properties"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "1997math......6206B"
    }
  }
}