Mathematics for Computer Science

Logic:

proposition

Goldbach’s Conjecture

An implication is true when the if part is false or the then part is true.

contrapositive P implies Q -------------(not Q) implies (not P)

converse

Thus, an implication is logically equivalent to its contrapositive, but is not equivalent to its converse

∅ t he empty set none
N  natural numbers {0,1,2,3,...}
Z  integers {...,−3,−2,−1,0,1,2,3,...}
                                    
                                     1     5
Q rational numbers 2, − 3, 16, etc.

R real numbers π, e, −9, etc.

C complex numbers i, 19/2 , √2 − 2i, etc.

The union of sets X and Y (denoted X∪ Y) contains all elements appearing in X or Y or both. Thus, X ∪ Y = {1,2,3,4}.
•
The intersection of X and Y (denoted X∩ Y) consists of all elements that appear in both X and Y. So X ∩ Y = {2,3}.
•
The difference of X and Y (denoted X− Y) consists of all elements that are in X, but not in Y. Therefore, X− Y = {1} and Y − X= {4}.


The elements of a set are required to be distinct, but terms in a sequence can be the same. Thus, (a,b,a)is a valid sequence, but {a,b,a} is not a valid set.
•
The terms in a sequence have a specified order, but the elements of a set do not. For example, (a,b,c)and (a,c,b)are different sequences, but {a,b,c} and {a,c,b} are the same set.
•
The empty set is usually denoted ∅, and the empty sequence is typically λ.

The product operation is one link between sets and sequences. A product of sets, S1 × S2 × ... × Sn, is a new set consisting of all sequences where the first component is drawn from S1, the second from S2, and so forth.

Predicates
A predicate is a proposition whose truth depends on the value of one or more variables. For example,
“n is a perfect square”

Specifically, an assertion that a predicate is always true is called a universal quantification, and an assertion that a predicate is sometimes true is an existential quantification.