{
  "id": "1302.1368",
  "version": "v1",
  "published": "2013-02-06T13:40:35.000Z",
  "updated": "2013-02-06T13:40:35.000Z",
  "title": "On the finitizability problem in algebraic logic; recent results",
  "authors": [
    "Tarek Sayed Ahmed"
  ],
  "categories": [
    "math.LO"
  ],
  "abstract": "This is a survey article in algebraic logic, where we take a magical tour from old concepts due to Henkin, Monk and Tarski like neat embeddings, to modern views and perspectives, culminating in the use of Erdos graphs in settling important questions in algebraic logic.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-02-06T13:40:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "algebraic logic",
      "finitizability problem",
      "old concepts",
      "neat embeddings",
      "erdos graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1302.1368S"
    }
  }
}