See Heyting algebra in All languages combined, or Wiktionary
{
"etymology_text": "After Dutch mathematician Arend Heyting, who developed the theory as a way of modelling his intuitionistic logic.",
"forms": [
{
"form": "Heyting algebras",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Heyting algebra (plural Heyting algebras)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"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 Italian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Algebra",
"orig": "en:Algebra",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"derived": [
{
"word": "bi-Heyting algebra"
},
{
"word": "biHeyting algebra"
},
{
"word": "co-Heyting algebra"
},
{
"word": "coHeyting algebra"
},
{
"word": "complete Heyting algebra"
}
],
"examples": [
{
"ref": "1984, Robert Goldblatt, Topoi, the categorial analysis of logic, page xii:",
"text": "The laws of Heyting algebra embody a rich and profound mathematical structure that is manifest in a variety of contexts. It arises from the epistemological deliberations of Brouwer, the topologisation (localisation) of set-theoretic notions, and the categorial formulation of set theory, all of which, although interrelated, are independently motivated. The ubiquity lends weight, not to the suggestion that the correct logic is in fact intuitionistic instead of classical, but rather to the recognition that thinking in such terms is simply inappropriate — in the same way that it is inappropriate to speak without qualification about the correct geometry.",
"type": "quote"
},
{
"ref": "1994, Francis Borceux, Handbook of Categorical Algebra 3: Categories of Sheaves, Cambridge University Press, page 13, Proposition 1.2.14 should certainly be completed by the observation that the modus ponens holds as well in every Heyting algebra. Since, in the intuitionistic propositional calculus, being a true formula is being a terminal object (see proof of 1.1.3), the modus ponens of a Heyting algebra reduces to a=1 and a<b imply b=1",
"text": "which is just obvious."
},
{
"text": "1997, J. G. Stell, M. W. Worboys, The Algebraic Structure of Sets and Regions, Stephen C. Hirtle, Andrew U. Frank (editors), Spatial Information Theory A Theoretical Basis for GIS: International Conference, Proceedings, Springer, LNCS 1329, page 163,\nThe main contention of this paper is that Heyting algebras, and related structures, provide elegant and natural theories of parthood and boundary which have close connections to the above three ontologies."
}
],
"glosses": [
"A bounded lattice, L, modified to serve as a model for a logical calculus by being equipped with a binary operation called \"implies\", denoted → (sometimes ⊃ or ⇒), defined such that (a→b)∧a ≤ b and, moreover, that x = a→b is the greatest element such that x∧a ≤ b (in the sense that if c∧a ≤ b then c ≤ a→b)."
],
"hypernyms": [
{
"sense": "bounded lattice",
"word": "distributive lattice"
},
{
"sense": "bounded lattice",
"word": "residuated lattice"
},
{
"sense": "bounded lattice",
"word": "bicartesian closed category"
}
],
"hyponyms": [
{
"sense": "bounded lattice",
"word": "Boolean algebra"
},
{
"sense": "bounded lattice",
"word": "complete Heyting algebra"
},
{
"sense": "bounded lattice",
"word": "finite distributive lattice"
}
],
"id": "en-Heyting_algebra-en-noun-DIWbcgel",
"links": [
[
"algebra",
"algebra"
],
[
"bounded lattice",
"bounded lattice"
],
[
"logical calculus",
"logical calculus"
],
[
"binary operation",
"binary operation"
],
[
"→",
"→"
],
[
"⊃",
"⊃"
],
[
"⇒",
"⇒"
]
],
"raw_glosses": [
"(algebra, order theory) A bounded lattice, L, modified to serve as a model for a logical calculus by being equipped with a binary operation called \"implies\", denoted → (sometimes ⊃ or ⇒), defined such that (a→b)∧a ≤ b and, moreover, that x = a→b is the greatest element such that x∧a ≤ b (in the sense that if c∧a ≤ b then c ≤ a→b)."
],
"related": [
{
"word": "Heyting prealgebra"
},
{
"word": "pseudo-complement"
},
{
"word": "relative pseudo-complement"
},
{
"word": "residuated lattice"
}
],
"synonyms": [
{
"sense": "bounded lattice",
"word": "pseudo-Boolean algebra"
}
],
"topics": [
"algebra",
"mathematics",
"order-theory",
"sciences"
],
"translations": [
{
"code": "it",
"lang": "Italian",
"sense": "bounded lattice equipped with operation called implies",
"tags": [
"feminine"
],
"word": "algebra di Heyting"
}
],
"wikipedia": [
"Arend Heyting",
"Heyting algebra",
"intuitionistic logic"
]
}
],
"word": "Heyting algebra"
}
{
"derived": [
{
"word": "bi-Heyting algebra"
},
{
"word": "biHeyting algebra"
},
{
"word": "co-Heyting algebra"
},
{
"word": "coHeyting algebra"
},
{
"word": "complete Heyting algebra"
}
],
"etymology_text": "After Dutch mathematician Arend Heyting, who developed the theory as a way of modelling his intuitionistic logic.",
"forms": [
{
"form": "Heyting algebras",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Heyting algebra (plural Heyting algebras)",
"name": "en-noun"
}
],
"hypernyms": [
{
"sense": "bounded lattice",
"word": "distributive lattice"
},
{
"sense": "bounded lattice",
"word": "residuated lattice"
},
{
"sense": "bounded lattice",
"word": "bicartesian closed category"
}
],
"hyponyms": [
{
"sense": "bounded lattice",
"word": "Boolean algebra"
},
{
"sense": "bounded lattice",
"word": "complete Heyting algebra"
},
{
"sense": "bounded lattice",
"word": "finite distributive lattice"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Heyting prealgebra"
},
{
"word": "pseudo-complement"
},
{
"word": "relative pseudo-complement"
},
{
"word": "residuated lattice"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Quotation templates to be cleaned",
"Terms with Italian translations",
"en:Algebra"
],
"examples": [
{
"ref": "1984, Robert Goldblatt, Topoi, the categorial analysis of logic, page xii:",
"text": "The laws of Heyting algebra embody a rich and profound mathematical structure that is manifest in a variety of contexts. It arises from the epistemological deliberations of Brouwer, the topologisation (localisation) of set-theoretic notions, and the categorial formulation of set theory, all of which, although interrelated, are independently motivated. The ubiquity lends weight, not to the suggestion that the correct logic is in fact intuitionistic instead of classical, but rather to the recognition that thinking in such terms is simply inappropriate — in the same way that it is inappropriate to speak without qualification about the correct geometry.",
"type": "quote"
},
{
"ref": "1994, Francis Borceux, Handbook of Categorical Algebra 3: Categories of Sheaves, Cambridge University Press, page 13, Proposition 1.2.14 should certainly be completed by the observation that the modus ponens holds as well in every Heyting algebra. Since, in the intuitionistic propositional calculus, being a true formula is being a terminal object (see proof of 1.1.3), the modus ponens of a Heyting algebra reduces to a=1 and a<b imply b=1",
"text": "which is just obvious."
},
{
"text": "1997, J. G. Stell, M. W. Worboys, The Algebraic Structure of Sets and Regions, Stephen C. Hirtle, Andrew U. Frank (editors), Spatial Information Theory A Theoretical Basis for GIS: International Conference, Proceedings, Springer, LNCS 1329, page 163,\nThe main contention of this paper is that Heyting algebras, and related structures, provide elegant and natural theories of parthood and boundary which have close connections to the above three ontologies."
}
],
"glosses": [
"A bounded lattice, L, modified to serve as a model for a logical calculus by being equipped with a binary operation called \"implies\", denoted → (sometimes ⊃ or ⇒), defined such that (a→b)∧a ≤ b and, moreover, that x = a→b is the greatest element such that x∧a ≤ b (in the sense that if c∧a ≤ b then c ≤ a→b)."
],
"links": [
[
"algebra",
"algebra"
],
[
"bounded lattice",
"bounded lattice"
],
[
"logical calculus",
"logical calculus"
],
[
"binary operation",
"binary operation"
],
[
"→",
"→"
],
[
"⊃",
"⊃"
],
[
"⇒",
"⇒"
]
],
"raw_glosses": [
"(algebra, order theory) A bounded lattice, L, modified to serve as a model for a logical calculus by being equipped with a binary operation called \"implies\", denoted → (sometimes ⊃ or ⇒), defined such that (a→b)∧a ≤ b and, moreover, that x = a→b is the greatest element such that x∧a ≤ b (in the sense that if c∧a ≤ b then c ≤ a→b)."
],
"topics": [
"algebra",
"mathematics",
"order-theory",
"sciences"
],
"wikipedia": [
"Arend Heyting",
"Heyting algebra",
"intuitionistic logic"
]
}
],
"synonyms": [
{
"sense": "bounded lattice",
"word": "pseudo-Boolean algebra"
}
],
"translations": [
{
"code": "it",
"lang": "Italian",
"sense": "bounded lattice equipped with operation called implies",
"tags": [
"feminine"
],
"word": "algebra di Heyting"
}
],
"word": "Heyting algebra"
}
Download raw JSONL data for Heyting algebra meaning in English (4.5kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-28 from the enwiktionary dump dated 2024-11-21 using wiktextract (65a6e81 and 0dbea76). 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.