Class

algebra.instances

BooleanAlgebra

Related Doc: package instances

Permalink

class BooleanAlgebra extends Bool[Boolean] with CommutativeRig[Boolean]

This commutative rig is different than the one obtained from GF(2).

It uses || for plus, and && for times.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BooleanAlgebra
  2. CommutativeRig
  3. MultiplicativeCommutativeMonoid
  4. CommutativeSemiring
  5. MultiplicativeCommutativeSemigroup
  6. Rig
  7. MultiplicativeMonoid
  8. Semiring
  9. MultiplicativeSemigroup
  10. AdditiveCommutativeMonoid
  11. AdditiveCommutativeSemigroup
  12. AdditiveMonoid
  13. AdditiveSemigroup
  14. Bool
  15. GenBool
  16. Heyting
  17. BoundedDistributiveLattice
  18. DistributiveLattice
  19. BoundedLattice
  20. BoundedJoinSemilattice
  21. BoundedMeetSemilattice
  22. Lattice
  23. MeetSemilattice
  24. JoinSemilattice
  25. Serializable
  26. Serializable
  27. AnyRef
  28. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BooleanAlgebra()

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def additive: CommutativeMonoid[Boolean]

    Permalink
  5. def and(x: Boolean, y: Boolean): Boolean

    Permalink
    Definition Classes
    BooleanAlgebraGenBoolHeyting
  6. def asBoolRing: BoolRing[Boolean]

    Permalink

    Every Boolean algebra is a BoolRing, with multiplication defined as and and addition defined as xor.

    Every Boolean algebra is a BoolRing, with multiplication defined as and and addition defined as xor. Bool does not extend BoolRing because, e.g. we might want a Bool[Int] and CommutativeRing[Int] to refer to different structures, by default.

    Note that the ring returned by this method is not an extension of the Rig returned from BoundedDistributiveLattice.asCommutativeRig.

    Definition Classes
    BoolGenBool
  7. def asCommutativeRig: CommutativeRig[Boolean]

    Permalink

    Return a CommutativeRig using join and meet.

    Return a CommutativeRig using join and meet. Note this must obey the commutative rig laws since meet(a, one) = a, and meet and join are associative, commutative and distributive.

    Definition Classes
    BoundedDistributiveLattice
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def complement(x: Boolean): Boolean

    Permalink
    Definition Classes
    BooleanAlgebraHeyting
  11. def dual: Bool[Boolean]

    Permalink

    This is the lattice with meet and join swapped

    This is the lattice with meet and join swapped

    Definition Classes
    BoolBoundedDistributiveLatticeBoundedLatticeLattice
  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  17. def imp(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    BoolHeyting
  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  19. def isOne(x: Boolean)(implicit ev: Eq[Boolean]): Boolean

    Permalink

    Tests if a is one.

    Tests if a is one.

    Definition Classes
    BooleanAlgebraMultiplicativeMonoidBoundedMeetSemilattice
  20. def isZero(x: Boolean)(implicit ev: Eq[Boolean]): Boolean

    Permalink

    Tests if a is zero.

    Tests if a is zero.

    Definition Classes
    BooleanAlgebraAdditiveMonoidBoundedJoinSemilattice
  21. def join(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    GenBoolJoinSemilattice
  22. def joinPartialOrder(implicit ev: Eq[Boolean]): PartialOrder[Boolean]

    Permalink
    Definition Classes
    JoinSemilattice
  23. def joinSemilattice: BoundedSemilattice[Boolean]

    Permalink
  24. def meet(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    GenBoolMeetSemilattice
  25. def meetPartialOrder(implicit ev: Eq[Boolean]): PartialOrder[Boolean]

    Permalink
    Definition Classes
    MeetSemilattice
  26. def meetSemilattice: BoundedSemilattice[Boolean]

    Permalink
  27. def multiplicative: CommutativeMonoid[Boolean]

    Permalink
  28. def nand(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    Heyting
  29. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  30. def nor(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    Heyting
  31. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  32. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  33. def nxor(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    Heyting
  34. def one: Boolean

    Permalink
  35. def or(x: Boolean, y: Boolean): Boolean

    Permalink
    Definition Classes
    BooleanAlgebraGenBoolHeyting
  36. def plus(a: Boolean, b: Boolean): Boolean

    Permalink
    Definition Classes
    BooleanAlgebraAdditiveSemigroup
  37. def positivePow(a: Boolean, n: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    MultiplicativeSemigroup
  38. def positiveSumN(a: Boolean, n: Int): Boolean

    Permalink
    Attributes
    protected[this]
    Definition Classes
    AdditiveSemigroup
  39. def pow(a: Boolean, b: Int): Boolean

    Permalink
  40. def product(as: TraversableOnce[Boolean]): Boolean

    Permalink

    Given a sequence of as, compute the product.

    Given a sequence of as, compute the product.

    Definition Classes
    MultiplicativeMonoid
  41. def sum(as: TraversableOnce[Boolean]): Boolean

    Permalink

    Given a sequence of as, compute the sum.

    Given a sequence of as, compute the sum.

    Definition Classes
    AdditiveMonoid
  42. def sumN(a: Boolean, n: Int): Boolean

    Permalink
    Definition Classes
    AdditiveMonoidAdditiveSemigroup
  43. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  44. def times(a: Boolean, b: Boolean): Boolean

    Permalink
  45. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  46. def tryProduct(as: TraversableOnce[Boolean]): Option[Boolean]

    Permalink

    Given a sequence of as, combine them and return the total.

    Given a sequence of as, combine them and return the total.

    If the sequence is empty, returns None. Otherwise, returns Some(total).

    Definition Classes
    MultiplicativeMonoidMultiplicativeSemigroup
  47. def trySum(as: TraversableOnce[Boolean]): Option[Boolean]

    Permalink

    Given a sequence of as, combine them and return the total.

    Given a sequence of as, combine them and return the total.

    If the sequence is empty, returns None. Otherwise, returns Some(total).

    Definition Classes
    AdditiveMonoidAdditiveSemigroup
  48. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. def without(a: Boolean, b: Boolean): Boolean

    Permalink

    The operation of relative complement, symbolically often denoted a\b (the symbol for set-theoretic difference, which is the meaning of relative complement in the lattice of sets).

    The operation of relative complement, symbolically often denoted a\b (the symbol for set-theoretic difference, which is the meaning of relative complement in the lattice of sets).

    Definition Classes
    BoolGenBool
  52. def xor(a: Boolean, b: Boolean): Boolean

    Permalink

    Logical exclusive or, set-theoretic symmetric difference.

    Logical exclusive or, set-theoretic symmetric difference. Defined as a\b ∨ b\a.

    Definition Classes
    BoolGenBoolHeyting
  53. def zero: Boolean

    Permalink

Inherited from CommutativeRig[Boolean]

Inherited from CommutativeSemiring[Boolean]

Inherited from Rig[Boolean]

Inherited from MultiplicativeMonoid[Boolean]

Inherited from Semiring[Boolean]

Inherited from AdditiveMonoid[Boolean]

Inherited from AdditiveSemigroup[Boolean]

Inherited from Bool[Boolean]

Inherited from GenBool[Boolean]

Inherited from Heyting[Boolean]

Inherited from DistributiveLattice[Boolean]

Inherited from BoundedLattice[Boolean]

Inherited from Lattice[Boolean]

Inherited from MeetSemilattice[Boolean]

Inherited from JoinSemilattice[Boolean]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped