See superintuitionistic on Wiktionary
{ "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "intuitionistic" }, "expansion": "super- + intuitionistic", "name": "prefix" } ], "etymology_text": "From super- + intuitionistic.", "head_templates": [ { "args": { "1": "-" }, "expansion": "superintuitionistic (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 prefixed with super-", "parents": [], "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" } ], "examples": [ { "ref": "2015, Emil Jeřábek, “Proof complexity of intuitionistic implicational formulas”, in arXiv:", "text": "The results also apply to other fragments of other superintuitionistic logics under certain conditions. In particular, the exponential lower bounds on the length of intuitionistic EF proofs by Hrube\\v{s} \\cite{hru:lbint}, generalized to exponential separation between EF and SF systems in superintuitionistic logics of unbounded branching by Je\\v{r}\\'abek \\cite{ej:sfef}, can be realized by implicational tautologies..", "type": "quote" } ], "glosses": [ "Describing an extended form of intuitionistic logic" ], "id": "en-superintuitionistic-en-adj-1uYdCoBk", "links": [ [ "logic", "logic" ], [ "intuitionistic logic", "intuitionistic logic" ] ], "raw_glosses": [ "(logic) Describing an extended form of intuitionistic logic" ], "tags": [ "not-comparable" ], "topics": [ "human-sciences", "logic", "mathematics", "philosophy", "sciences" ] } ], "word": "superintuitionistic" }
{ "etymology_templates": [ { "args": { "1": "en", "2": "super", "3": "intuitionistic" }, "expansion": "super- + intuitionistic", "name": "prefix" } ], "etymology_text": "From super- + intuitionistic.", "head_templates": [ { "args": { "1": "-" }, "expansion": "superintuitionistic (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ "English adjectives", "English entries with incorrect language header", "English lemmas", "English terms prefixed with super-", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries", "en:Logic" ], "examples": [ { "ref": "2015, Emil Jeřábek, “Proof complexity of intuitionistic implicational formulas”, in arXiv:", "text": "The results also apply to other fragments of other superintuitionistic logics under certain conditions. In particular, the exponential lower bounds on the length of intuitionistic EF proofs by Hrube\\v{s} \\cite{hru:lbint}, generalized to exponential separation between EF and SF systems in superintuitionistic logics of unbounded branching by Je\\v{r}\\'abek \\cite{ej:sfef}, can be realized by implicational tautologies..", "type": "quote" } ], "glosses": [ "Describing an extended form of intuitionistic logic" ], "links": [ [ "logic", "logic" ], [ "intuitionistic logic", "intuitionistic logic" ] ], "raw_glosses": [ "(logic) Describing an extended form of intuitionistic logic" ], "tags": [ "not-comparable" ], "topics": [ "human-sciences", "logic", "mathematics", "philosophy", "sciences" ] } ], "word": "superintuitionistic" }
Download raw JSONL data for superintuitionistic meaning in All languages combined (1.5kB)
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-12-03 from the enwiktionary dump dated 2024-11-21 using wiktextract (94ba7e1 and 5dea2a6). 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.