trait
Bool[A] extends Heyting[A]
Abstract Value Members
-
abstract
def
and(a: A, b: A): A
-
abstract
def
complement(a: A): A
-
abstract
def
getClass(): Class[_]
-
abstract
def
one: A
-
abstract
def
or(a: A, b: A): A
-
abstract
def
zero: A
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
dual: Bool[A]
-
def
equals(arg0: Any): Boolean
-
def
hashCode(): Int
-
def
imp(a: A, b: A): A
-
final
def
isInstanceOf[T0]: Boolean
-
def
isOne(a: A)(implicit ev: Eq[A]): Boolean
-
def
isZero(a: A)(implicit ev: Eq[A]): Boolean
-
def
join(a: A, b: A): A
-
def
meet(a: A, b: A): A
-
def
nand(a: A, b: A): A
-
def
nor(a: A, b: A): A
-
def
nxor(a: A, b: A): A
-
def
toString(): String
-
def
xor(a: A, b: A): A
A boolean algebra is a structure that defines a few basic operations, namely as conjunction (&), disjunction (|), and negation (~). Both conjunction and disjunction must be associative, commutative and should distribute over each other. Also, both have an identity and they obey the absorption law; that is
x & (y | x) == xandx | (x & y) == x.