Definitions from Wiktionary (Heyting algebra)
▸ noun: (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).
▸ Words similar to Heyting algebra
▸ Usage examples for Heyting algebra
▸ Idioms related to Heyting algebra
▸ Wikipedia articles (New!)
▸ Words that often appear near Heyting algebra
▸ Rhymes of Heyting algebra
▸ Invented words related to Heyting algebra
▸ noun: (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).
Similar:
bounded lattice,
Boolean lattice,
Boolean algebra,
turnstile,
meet,
join,
complete lattice,
bilattice,
lattice,
antilattice,
more...
Opposite:
▸ Words similar to Heyting algebra
▸ Usage examples for Heyting algebra
▸ Idioms related to Heyting algebra
▸ Wikipedia articles (New!)
▸ Words that often appear near Heyting algebra
▸ Rhymes of Heyting algebra
▸ Invented words related to Heyting algebra