"Rosser's trick" meaning in English

{
  "etymology_text": "Introduced by J. Barkley Rosser in 1936.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Rosser's trick",
      "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A method for proving Gödel's incompleteness theorems without the assumption that the theory being considered is ω-consistent. While Gödel's original proof uses a sentence that states (informally) \"This sentence is not provable\", Rosser's trick uses a formula that says \"If this sentence is provable, there is a shorter proof of its negation\"."
      ],
      "id": "en-Rosser's_trick-en-name-tjt7KaFO",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "method",
          "method"
        ],
        [
          "proving",
          "prove"
        ],
        [
          "Gödel's incompleteness theorem",
          "Gödel's incompleteness theorem"
        ],
        [
          "assumption",
          "assumption"
        ],
        [
          "ω-consistent",
          "ω-consistent"
        ],
        [
          "sentence",
          "sentence"
        ],
        [
          "provable",
          "provable"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "negation",
          "negation"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A method for proving Gödel's incompleteness theorems without the assumption that the theory being considered is ω-consistent. While Gödel's original proof uses a sentence that states (informally) \"This sentence is not provable\", Rosser's trick uses a formula that says \"If this sentence is provable, there is a shorter proof of its negation\"."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Rosser's trick"
      ]
    }
  ],
  "word": "Rosser's trick"
}

{
  "etymology_text": "Introduced by J. Barkley Rosser in 1936.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Rosser's trick",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Mathematics"
      ],
      "glosses": [
        "A method for proving Gödel's incompleteness theorems without the assumption that the theory being considered is ω-consistent. While Gödel's original proof uses a sentence that states (informally) \"This sentence is not provable\", Rosser's trick uses a formula that says \"If this sentence is provable, there is a shorter proof of its negation\"."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "method",
          "method"
        ],
        [
          "proving",
          "prove"
        ],
        [
          "Gödel's incompleteness theorem",
          "Gödel's incompleteness theorem"
        ],
        [
          "assumption",
          "assumption"
        ],
        [
          "ω-consistent",
          "ω-consistent"
        ],
        [
          "sentence",
          "sentence"
        ],
        [
          "provable",
          "provable"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "negation",
          "negation"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A method for proving Gödel's incompleteness theorems without the assumption that the theory being considered is ω-consistent. While Gödel's original proof uses a sentence that states (informally) \"This sentence is not provable\", Rosser's trick uses a formula that says \"If this sentence is provable, there is a shorter proof of its negation\"."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Rosser's trick"
      ]
    }
  ],
  "word": "Rosser's trick"
}