"praeclarum theorema" meaning in All languages combined

See praeclarum theorema on Wiktionary

Noun [Translingual]

Etymology: So named by G.W. Leibniz in his unpublished papers of 1690 (later published as Leibniz: Logical Papers in 1966), meaning "splendid theorem" in Latin. Head templates: {{head|mul|noun|head=praeclarum theorema}} praeclarum theorema
  1. (logic) The following theorem of propositional calculus: (A → B) ∧ (C → D) → (A ∧ C → B ∧ D). Wikipedia link: Gottfried Wilhelm Leibniz Categories (topical): Logic Related terms: constructive dilemma
    Sense id: en-praeclarum_theorema-mul-noun-1MSVQerm Categories (other): Pages with 1 entry, Translingual entries with incorrect language header Topics: human-sciences, logic, mathematics, philosophy, sciences
{
  "etymology_text": "So named by G.W. Leibniz in his unpublished papers of 1690 (later published as Leibniz: Logical Papers in 1966), meaning \"splendid theorem\" in Latin.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "2": "noun",
        "head": "praeclarum theorema"
      },
      "expansion": "praeclarum theorema",
      "name": "head"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Translingual entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "mul",
          "name": "Logic",
          "orig": "mul:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "The praeclarum theorema can be seen to correspond with the rule R⊗ of linear logic; given two sequents A⊢B and C⊢D one may infer (through the said rule) that A,C⊢B⊗D. Then one may further infer, through the rule L⊗, that A⊗C⊢B⊗D."
        }
      ],
      "glosses": [
        "The following theorem of propositional calculus: (A → B) ∧ (C → D) → (A ∧ C → B ∧ D)."
      ],
      "id": "en-praeclarum_theorema-mul-noun-1MSVQerm",
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "propositional calculus",
          "propositional calculus"
        ]
      ],
      "raw_glosses": [
        "(logic) The following theorem of propositional calculus: (A → B) ∧ (C → D) → (A ∧ C → B ∧ D)."
      ],
      "related": [
        {
          "word": "constructive dilemma"
        }
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ],
      "wikipedia": [
        "Gottfried Wilhelm Leibniz"
      ]
    }
  ],
  "word": "praeclarum theorema"
}
{
  "etymology_text": "So named by G.W. Leibniz in his unpublished papers of 1690 (later published as Leibniz: Logical Papers in 1966), meaning \"splendid theorem\" in Latin.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "2": "noun",
        "head": "praeclarum theorema"
      },
      "expansion": "praeclarum theorema",
      "name": "head"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "noun",
  "related": [
    {
      "word": "constructive dilemma"
    }
  ],
  "senses": [
    {
      "categories": [
        "Pages with 1 entry",
        "Translingual entries with incorrect language header",
        "Translingual lemmas",
        "Translingual nouns",
        "Translingual terms with redundant head parameter",
        "mul:Logic"
      ],
      "examples": [
        {
          "text": "The praeclarum theorema can be seen to correspond with the rule R⊗ of linear logic; given two sequents A⊢B and C⊢D one may infer (through the said rule) that A,C⊢B⊗D. Then one may further infer, through the rule L⊗, that A⊗C⊢B⊗D."
        }
      ],
      "glosses": [
        "The following theorem of propositional calculus: (A → B) ∧ (C → D) → (A ∧ C → B ∧ D)."
      ],
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "propositional calculus",
          "propositional calculus"
        ]
      ],
      "raw_glosses": [
        "(logic) The following theorem of propositional calculus: (A → B) ∧ (C → D) → (A ∧ C → B ∧ D)."
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ],
      "wikipedia": [
        "Gottfried Wilhelm Leibniz"
      ]
    }
  ],
  "word": "praeclarum theorema"
}

Download raw JSONL data for praeclarum theorema meaning in All languages combined (1.4kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-09-22 from the enwiktionary dump dated 2024-09-20 using wiktextract (af5c55c and 66545a6). 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.