Last Updated：2025/11/26
(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).
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Heyting algebra
Edit Histories（0）
Source Word
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).
Japanese Meaning
ヒーティング代数：論理計算のモデルとして利用される有界格子であり、二項演算「含意」（→、または⊃や⇒）を備える。具体的には、(a→b)∧a ≤ bを満たし、さらにx = a→bがx∧a ≤ bとなるような最大の元となるように定義される代数構造。
Sense（1）
(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).
（ plural ）
