{
  "id": "1902.05533",
  "version": "v1",
  "published": "2019-02-14T18:26:00.000Z",
  "updated": "2019-02-14T18:26:00.000Z",
  "title": "Quantifier alternation in a class of recursively defined tree properties",
  "authors": [
    "Moumanti Podder"
  ],
  "comment": "4 figures, 18 pages",
  "categories": [
    "math.LO",
    "math.CO"
  ],
  "abstract": "Alternating quantifier depth is a natural measure of difficulty required to express first order logical sentences. We define a sequence of first order properties on rooted, locally finite trees in a recursive manner, and provide rigorous arguments for finding the alternating quantifier depth of each property in the sequence, using Ehrenfeucht-Fra\\\"{i}ss\\'{e} games.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-02-14T18:26:00.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "recursively defined tree properties",
      "quantifier alternation",
      "alternating quantifier depth",
      "express first order logical sentences",
      "first order properties"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 18,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}