Search Results for ""

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

A function whose range is in the complex numbers is said to be a complex function, or a complex-valued function.

A complex map is a map f:C->C. The following table lists several common types of complex maps. map formula domain complex magnification f(z)=az a in R, a>0 complex rotation ...

The absence of contradiction (i.e., the ability to prove that a statement and its negative are both true) in an Axiomatic system is known as consistency.

A formal argument in logic in which it is stated that (1) P=>Q and R=>S (where => means "implies"), and (2) either P or R is true, from which two statements it follows that ...

A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'

A sentence is called a contradiction if its truth table contains only false entries.

Given the statement "if P, then Q," or P=>Q, the converse is "if Q, then P." For example, the converse of "If a thing is a dog then it is a mammal" is "If a thing is a mammal ...

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...