Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def Biimplication[M](f: PropositionalFormula[M], g: PropositionalFormula[M]): PropositionalFormula[M]
5.  def Implication[M](premise: PropositionalFormula[M], conclusion: PropositionalFormula[M]): PropositionalFormula[M]
6.  def Nand[M](f: PropositionalFormula[M], g: PropositionalFormula[M]): PropositionalFormula[M]
7.  def Nor[M](f: PropositionalFormula[M], g: PropositionalFormula[M]): PropositionalFormula[M]
8.  def Xnor[M](f: PropositionalFormula[M], g: PropositionalFormula[M]): PropositionalFormula[M]
9.  def Xor[M](f: PropositionalFormula[M], g: PropositionalFormula[M]): PropositionalFormula[M]
10.  def applyDeMorganRule[M](f: PropositionalFormula[M]): PropositionalFormula[M]

    applies the rule "not ( f and g ) -> (not f) or (not g) and the according rule resulting by exchaning and and or with the goal to push negations inside

11.  def applyDistributivityLaw[M](f: PropositionalFormula[M]): PropositionalFormula[M]

    applies the general distributivity law: (f11 or ...

    applies the general distributivity law: (f11 or ... or f1n) and ... and (fm1 or ... or fmn)

    (f11 and f21 and ... and fm1) or ... and the according rule when and and or are interchanged

12.  def applyDistributivityLawForAnd[M](f: PropositionalFormula[M]): PropositionalFormula[M]

    pushes and inside and fetches or outside

13.  def applyDistributivityLawForOr[M](f: PropositionalFormula[M]): PropositionalFormula[M]

    pushes or inside and fetches and outside

14.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

15.  def cartesianProduct[A, B, C](as: Set[A], bs: Set[B], cs: Set[C]): Set[(A, B, C)]
16.  def cartesianProduct[A, B](as: Set[A], bs: Set[B]): Set[(A, B)]
17.  def cartesianProduct[T](sets: Set[Set[T]]): Set[Set[T]]

    returns the set of those sets which contain exactly one element from each set in the input set.

18.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()

19.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

20.  def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

21.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

22.  def flattenSingletonAndsAndOrs[M](f: PropositionalFormula[M]): PropositionalFormula[M]
23.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

24.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

25.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

26.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

27.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

28.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

29.  def parsePropositionalFormula(string: String): PropositionalFormula[String]
30.  def removeDoubleNegations[M](f: PropositionalFormula[M]): PropositionalFormula[M]
31.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

32.  def toString(): String

    Definition Classes

    AnyRef → Any

33.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

34.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()