"Paris-Harrington theorem" meaning in English

See Paris-Harrington theorem in All languages combined, or Wiktionary

Proper name

Forms: the Paris-Harrington theorem [canonical]
Etymology: Named after Jeff Paris and Leo Harrington, who carried out work on this topic. Head templates: {{en-proper noun|def=1}} the Paris-Harrington theorem
  1. (mathematical logic) A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic.
    Sense id: en-Paris-Harrington_theorem-en-name-O25cqUL5 Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries
     
{
  "etymology_text": "Named after Jeff Paris and Leo Harrington, who carried out work on this topic.",
  "forms": [
    {
      "form": "the Paris-Harrington theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Paris-Harrington theorem",
      "name": "en-proper noun"
    }
  ],
  "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"
        }
      ],
      "glosses": [
        "A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic."
      ],
      "id": "en-Paris-Harrington_theorem-en-name-O25cqUL5",
      "links": [
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "principle",
          "principle"
        ],
        [
          "Ramsey theory",
          "Ramsey theory"
        ],
        [
          "true",
          "true"
        ],
        [
          "provable",
          "provable"
        ],
        [
          "Peano arithmetic",
          "Peano arithmetic"
        ]
      ],
      "qualifier": "mathematical logic",
      "raw_glosses": [
        "(mathematical logic) A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic."
      ]
    }
  ],
  "word": "Paris-Harrington theorem"
}

{
  "etymology_text": "Named after Jeff Paris and Leo Harrington, who carried out work on this topic.",
  "forms": [
    {
      "form": "the Paris-Harrington theorem",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Paris-Harrington theorem",
      "name": "en-proper noun"
    }
  ],
  "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 uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "glosses": [
        "A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic."
      ],
      "links": [
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "principle",
          "principle"
        ],
        [
          "Ramsey theory",
          "Ramsey theory"
        ],
        [
          "true",
          "true"
        ],
        [
          "provable",
          "provable"
        ],
        [
          "Peano arithmetic",
          "Peano arithmetic"
        ]
      ],
      "qualifier": "mathematical logic",
      "raw_glosses": [
        "(mathematical logic) A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic."
      ]
    }
  ],
  "word": "Paris-Harrington theorem"
}

Download raw JSONL data for Paris-Harrington theorem meaning in English (1.2kB)

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-02-03 from the enwiktionary dump dated 2025-01-20 using wiktextract (05fdf6b and 9dbd323). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.