"intuitionistic" meaning in English

See intuitionistic in All languages combined, or Wiktionary

Adjective

Etymology: From intuition + -istic. Etymology templates: {{suffix|en|intuition|istic}} intuition + -istic Head templates: {{en-adj|-}} intuitionistic (not comparable)
  1. (mathematics, logic) Dealing strictly in constructive proofs, abstaining from proof by contradiction Tags: not-comparable Categories (topical): Logic, Mathematics Derived forms: intuitionistically, intuitionistic logic Related terms: intuitionism, intuition Translations (Translations): intuitionistinen (Finnish), intuitionistisch (German), intuizionistico (Italian), intuicjonistyczny (Polish), intuiționist (Romanian)
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "intuition",
        "3": "istic"
      },
      "expansion": "intuition + -istic",
      "name": "suffix"
    }
  ],
  "etymology_text": "From intuition + -istic.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intuitionistic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "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 terms suffixed with -istic",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Finnish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with German translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Italian translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Polish translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Romanian translations",
          "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": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "derived": [
        {
          "word": "intuitionistically"
        },
        {
          "word": "intuitionistic logic"
        }
      ],
      "examples": [
        {
          "text": "Intuitionistic type theory is based on a certain analogy or isomorphism between propositions and types: a proposition is identified with the type of its proofs. This identification is usually called the Curry–Howard isomorphism, which was originally formulated for intuitionistic logic and simply typed lambda calculus. Type Theory extends this identification to predicate logic by introducing dependent types, that is types which contain values. Type Theory internalizes the interpretation of intuitionistic logic proposed by Brouwer, Heyting and Kolmogorov, the so called BHK interpretation. The types of Type Theory play a similar role to sets in set theory but functions definable in Type Theory are always computable.ᵂᴾ"
        },
        {
          "text": "The system, which has come to be known as IZF, or Intuitionistic Zermelo–Fraenkel (ZF refers to ZFC without the axiom of choice), has the usual axioms of extensionality, pairing, union, infinity, separation and power set. The axiom of regularity is stated in the form of an axiom schema of set induction. Also, while Myhill used the axiom schema of replacement in his system, IZF usually stands for the version with collection.ᵂᴾ"
        }
      ],
      "glosses": [
        "Dealing strictly in constructive proofs, abstaining from proof by contradiction"
      ],
      "id": "en-intuitionistic-en-adj-FnK9BR1Q",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "proof by contradiction",
          "proof by contradiction"
        ]
      ],
      "raw_glosses": [
        "(mathematics, logic) Dealing strictly in constructive proofs, abstaining from proof by contradiction"
      ],
      "related": [
        {
          "word": "intuitionism"
        },
        {
          "word": "intuition"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ],
      "translations": [
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "Translations",
          "word": "intuitionistinen"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "Translations",
          "word": "intuitionistisch"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "Translations",
          "word": "intuizionistico"
        },
        {
          "code": "pl",
          "lang": "Polish",
          "sense": "Translations",
          "word": "intuicjonistyczny"
        },
        {
          "code": "ro",
          "lang": "Romanian",
          "sense": "Translations",
          "word": "intuiționist"
        }
      ]
    }
  ],
  "word": "intuitionistic"
}
{
  "derived": [
    {
      "word": "intuitionistically"
    },
    {
      "word": "intuitionistic logic"
    }
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "intuition",
        "3": "istic"
      },
      "expansion": "intuition + -istic",
      "name": "suffix"
    }
  ],
  "etymology_text": "From intuition + -istic.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intuitionistic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "intuitionism"
    },
    {
      "word": "intuition"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms suffixed with -istic",
        "English uncomparable adjectives",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Terms with Finnish translations",
        "Terms with German translations",
        "Terms with Italian translations",
        "Terms with Polish translations",
        "Terms with Romanian translations",
        "Translation table header lacks gloss",
        "en:Logic",
        "en:Mathematics"
      ],
      "examples": [
        {
          "text": "Intuitionistic type theory is based on a certain analogy or isomorphism between propositions and types: a proposition is identified with the type of its proofs. This identification is usually called the Curry–Howard isomorphism, which was originally formulated for intuitionistic logic and simply typed lambda calculus. Type Theory extends this identification to predicate logic by introducing dependent types, that is types which contain values. Type Theory internalizes the interpretation of intuitionistic logic proposed by Brouwer, Heyting and Kolmogorov, the so called BHK interpretation. The types of Type Theory play a similar role to sets in set theory but functions definable in Type Theory are always computable.ᵂᴾ"
        },
        {
          "text": "The system, which has come to be known as IZF, or Intuitionistic Zermelo–Fraenkel (ZF refers to ZFC without the axiom of choice), has the usual axioms of extensionality, pairing, union, infinity, separation and power set. The axiom of regularity is stated in the form of an axiom schema of set induction. Also, while Myhill used the axiom schema of replacement in his system, IZF usually stands for the version with collection.ᵂᴾ"
        }
      ],
      "glosses": [
        "Dealing strictly in constructive proofs, abstaining from proof by contradiction"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "proof by contradiction",
          "proof by contradiction"
        ]
      ],
      "raw_glosses": [
        "(mathematics, logic) Dealing strictly in constructive proofs, abstaining from proof by contradiction"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "Translations",
      "word": "intuitionistinen"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "Translations",
      "word": "intuitionistisch"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "Translations",
      "word": "intuizionistico"
    },
    {
      "code": "pl",
      "lang": "Polish",
      "sense": "Translations",
      "word": "intuicjonistyczny"
    },
    {
      "code": "ro",
      "lang": "Romanian",
      "sense": "Translations",
      "word": "intuiționist"
    }
  ],
  "word": "intuitionistic"
}

Download raw JSONL data for intuitionistic meaning in English (3.1kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-10-22 from the enwiktionary dump dated 2024-10-02 using wiktextract (eaa6b66 and a709d4b). 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.