object boolean extends BooleanInference0
Ordering
- Alphabetic
- By Inheritance
Inherited
- boolean
- BooleanInference0
- BooleanInference1
- BooleanInference2
- BooleanInference3
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
final
case class
AllOf[PS](ps: PS) extends Product with Serializable
Conjunction of all predicates in
PS. -
final
case class
And[A, B](a: A, b: B) extends Product with Serializable
Conjunction of the predicates
AandB. -
final
case class
AnyOf[PS](ps: PS) extends Product with Serializable
Disjunction of all predicates in
PS. -
final
case class
False() extends Product with Serializable
Constant predicate that is always
false. -
type
Nand[A, B] = Not[And[A, B]]
Negated conjunction of the predicates
AandB. -
type
Nor[A, B] = Not[Or[A, B]]
Negated disjunction of the predicates
AandB. -
final
case class
Not[P](p: P) extends Product with Serializable
Negation of the predicate
P. -
final
case class
OneOf[PS](ps: PS) extends Product with Serializable
Exclusive disjunction of all predicates in
PS. -
final
case class
Or[A, B](a: A, b: B) extends Product with Serializable
Disjunction of the predicates
AandB. -
final
case class
True() extends Product with Serializable
Constant predicate that is always
true. -
final
case class
Xor[A, B](a: A, b: B) extends Product with Serializable
Exclusive disjunction of the predicates
AandB.
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
implicit
def
conjunctionAssociativity[A, B, C]: ==>[And[And[A, B], C], And[A, And[B, C]]]
- Definition Classes
- BooleanInference0
-
implicit
def
conjunctionCommutativity[A, B]: ==>[And[A, B], And[B, A]]
- Definition Classes
- BooleanInference0
-
implicit
def
conjunctionEliminationL[A, B, C](implicit p1: ==>[A, C]): ==>[And[A, B], C]
- Definition Classes
- BooleanInference2
-
implicit
def
conjunctionEliminationR[A, B, C](implicit p1: ==>[B, C]): ==>[And[A, B], C]
- Definition Classes
- BooleanInference0
-
implicit
def
deMorgansLaw1[A, B]: ==>[Not[And[A, B]], Or[Not[A], Not[B]]]
- Definition Classes
- BooleanInference0
-
implicit
def
deMorgansLaw2[A, B]: ==>[Not[Or[A, B]], And[Not[A], Not[B]]]
- Definition Classes
- BooleanInference0
-
implicit
def
disjunctionAssociativity[A, B, C]: ==>[Or[Or[A, B], C], Or[A, Or[B, C]]]
- Definition Classes
- BooleanInference0
-
implicit
def
disjunctionCommutativity[A, B]: ==>[Or[A, B], Or[B, A]]
- Definition Classes
- BooleanInference0
-
implicit
def
disjunctionIntroductionL[A, B]: ==>[A, Or[A, B]]
- Definition Classes
- BooleanInference0
-
implicit
def
disjunctionIntroductionR[A, B]: ==>[B, Or[A, B]]
- Definition Classes
- BooleanInference0
-
implicit
def
disjunctionTautologyElimination[A, B, C](implicit p1: ==>[A, C], p2: ==>[B, C]): ==>[Or[A, B], C]
- Definition Classes
- BooleanInference3
-
implicit
def
doubleNegationElimination[A, B](implicit p1: ==>[A, B]): ==>[Not[Not[A]], B]
- Definition Classes
- BooleanInference0
-
implicit
def
doubleNegationIntroduction[A, B](implicit p1: ==>[A, B]): ==>[A, Not[Not[B]]]
- Definition Classes
- BooleanInference0
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
implicit
def
hypotheticalSyllogism[A, B, C](implicit p1: ==>[A, B], p2: ==>[B, C]): ==>[A, C]
- Definition Classes
- BooleanInference2
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
implicit
def
minimalTautology[A]: ==>[A, A]
- Definition Classes
- BooleanInference0
-
implicit
def
modusTollens[A, B](implicit p1: ==>[A, B]): ==>[Not[B], Not[A]]
- Definition Classes
- BooleanInference1
-
implicit
def
nandCommutativity[A, B]: ==>[Nand[A, B], Nand[B, A]]
- Definition Classes
- BooleanInference0
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
implicit
def
norCommutativity[A, B]: ==>[Nor[A, B], Nor[B, A]]
- Definition Classes
- BooleanInference0
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
implicit
def
substitutionInConjunction[A, B, C](implicit p1: ==>[B, C]): ==>[And[A, B], And[A, C]]
- Definition Classes
- BooleanInference3
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
implicit
def
xorCommutativity[A, B]: ==>[Xor[A, B], Xor[B, A]]
- Definition Classes
- BooleanInference0
- object AllOf extends Serializable
- object And extends Serializable
- object AnyOf extends Serializable
- object False extends Serializable
- object Not extends Serializable
- object OneOf extends Serializable
- object Or extends Serializable
- object True extends Serializable
- object Xor extends Serializable