Heyting algebra
bounded lattice that models intuitionistic propositional logic
Press Enter · cited answer in seconds
0 sources
Heyting algebra
Summary
Heyting algebra is a mathematical concept[1]. It draws 299 Wikipedia views per month (mathematical_concept category, ranking #165 of 1,007).[2]
Key Facts
- Heyting algebra's instance of is recorded as mathematical concept[3].
- Arend Heyting is named after Heyting algebra[4].
- Heyting algebra is a type of bounded lattice[5].
- Heyting algebra is a type of residuated lattice[6].
- Heyting algebra is a type of distributive lattice[7].
- Heyting algebra is a type of cartesian closed category[8].
- Heyting algebra is a type of finitely complete category[9].
- Heyting algebra is a type of finitely cocomplete category[10].
- Heyting algebra's Commons category is recorded as Heyting Algebra[11].
- Heyting algebra's studied by is recorded as lattice theory[12].
- Heyting algebra's studied by is recorded as mathematical logic[13].
- Heyting algebra's maintained by WikiProject is recorded as WikiProject Mathematics[14].
Body
Definition and Type
Heyting algebra's instance of is recorded as mathematical concept[3]. Recorded subclass of include bounded lattice[5], residuated lattice[6], distributive lattice[7], cartesian closed category[8], finitely complete category[9], and finitely cocomplete category[10].
Origins
Arend Heyting is named after Heyting algebra[4].
Why It Matters
Heyting algebra draws 299 Wikipedia views per month (mathematical_concept category, ranking #165 of 1,007).[2] It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.[15] It is known by 5 alternative names across languages and contexts.[16]