{
  "id": "math/0104195",
  "version": "v1",
  "published": "2001-04-19T17:46:50.000Z",
  "updated": "2001-04-19T17:46:50.000Z",
  "title": "Coding with ladders a well-ordering of the reals",
  "authors": [
    "Uri Abraham",
    "Saharon Shelah"
  ],
  "categories": [
    "math.LO"
  ],
  "abstract": "Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed to change at will the guessing properties of ladder systems on omega_1. Therefore, the study of such ladders is a main concern of this article.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2001-04-19T17:46:50.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "generic extension",
      "well-ordering",
      "proof consists",
      "ladder systems",
      "iterating posets"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2001math......4195A"
    }
  }
}