Discrete Math and its Applications
connectives - logical operators used to form new propositions from two or more existing propositions conjunction - "and"; true only when both propositions are true disjunction - "or"; false only when both propositions are false exclusive or - true only when exactly one of the propositions is true and false otherwise implication - conditional statement; "if p, then q" false when p is true and q is false, true otherwise. converse of p->q - q->p; equivalent to inverse contrapositive p->q - not q -> not p; has the same truth value as p->q always inverse of p->q - not p -> not q; equivalent to converse equivalent - two compound propositions always having the same truth value biconditionals (bi-implications; biconditional statements) - if and only if; true only when p and q have the same truth values; iff Precedence of logical operators - negation, conjunction, disjunction, conditional, biconditional bit - symbol with two possible values, namely 0 and 1 boolean variable - a variable with a value of either true or false bit string - sequence of zero or more bits; the length of this string is the number of bits in the string
Written for
- Institution
- Math
- Course
- Math
Document information
- Uploaded on
- December 26, 2023
- Number of pages
- 4
- Written in
- 2023/2024
- Type
- Exam (elaborations)
- Contains
- Questions & answers
Subjects
-
discrete math and its applications