"Lévy hierarchy" meaning in All languages combined

{
  "etymology_text": "Introduced by Azriel Lévy in 1965.",
  "forms": [
    {
      "form": "the Lévy hierarchy",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lévy hierarchy",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Set theory",
          "orig": "en:Set theory",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A hierarchy of formulas in the formal language of the Zermelo-Fraenkel set theory. Its first level contains only formulas with no unbounded quantifiers and is denoted by Δ₀=Σ₀=Π₀. Subsequent levels are given by finding a formula in prenex normal form which is provably equivalent over ZFC, and counting the number of changes of quantifiers."
      ],
      "id": "en-Lévy_hierarchy-en-name-mhEc0WFX",
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "hierarchy",
          "hierarchy"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "formal language",
          "formal language"
        ],
        [
          "Zermelo-Fraenkel set theory",
          "Zermelo-Fraenkel set theory"
        ],
        [
          "unbounded",
          "unbounded"
        ],
        [
          "quantifier",
          "quantifier"
        ],
        [
          "prenex normal form",
          "prenex normal form"
        ]
      ],
      "raw_glosses": [
        "(set theory, logic) A hierarchy of formulas in the formal language of the Zermelo-Fraenkel set theory. Its first level contains only formulas with no unbounded quantifiers and is denoted by Δ₀=Σ₀=Π₀. Subsequent levels are given by finding a formula in prenex normal form which is provably equivalent over ZFC, and counting the number of changes of quantifiers."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences",
        "set-theory"
      ]
    }
  ],
  "word": "Lévy hierarchy"
}

{
  "etymology_text": "Introduced by Azriel Lévy in 1965.",
  "forms": [
    {
      "form": "the Lévy hierarchy",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lévy hierarchy",
      "name": "en-prop"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with É",
        "English terms spelled with ◌́",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Logic",
        "en:Set theory"
      ],
      "glosses": [
        "A hierarchy of formulas in the formal language of the Zermelo-Fraenkel set theory. Its first level contains only formulas with no unbounded quantifiers and is denoted by Δ₀=Σ₀=Π₀. Subsequent levels are given by finding a formula in prenex normal form which is provably equivalent over ZFC, and counting the number of changes of quantifiers."
      ],
      "links": [
        [
          "set theory",
          "set theory"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "hierarchy",
          "hierarchy"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "formal language",
          "formal language"
        ],
        [
          "Zermelo-Fraenkel set theory",
          "Zermelo-Fraenkel set theory"
        ],
        [
          "unbounded",
          "unbounded"
        ],
        [
          "quantifier",
          "quantifier"
        ],
        [
          "prenex normal form",
          "prenex normal form"
        ]
      ],
      "raw_glosses": [
        "(set theory, logic) A hierarchy of formulas in the formal language of the Zermelo-Fraenkel set theory. Its first level contains only formulas with no unbounded quantifiers and is denoted by Δ₀=Σ₀=Π₀. Subsequent levels are given by finding a formula in prenex normal form which is provably equivalent over ZFC, and counting the number of changes of quantifiers."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences",
        "set-theory"
      ]
    }
  ],
  "word": "Lévy hierarchy"
}