{
  "id": "1606.01763",
  "version": "v1",
  "published": "2016-06-06T14:34:24.000Z",
  "updated": "2016-06-06T14:34:24.000Z",
  "title": "A Constructive Proof of Cut Elimination for a System of Full Second Order Logic",
  "authors": [
    "Sandro Skansi"
  ],
  "categories": [
    "math.LO",
    "cs.LO"
  ],
  "abstract": "In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using a new parameter for the induction, the cutweight. This technique can also be applied to first order logic.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-06-06T14:34:24.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03F05",
      "03F07",
      "F.4.1"
    ],
    "keywords": [
      "full second order logic",
      "cut elimination",
      "constructive proof",
      "first order logic",
      "cutrank growth"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}