logic
study of formal reasoning
proposition
any statement that is either true or false
propositional values
variables representing propositions
compound proposition
connecting propositions with logical operations;
logical operations
combines propositions with a rule
disjunction
or
conjuction
and
conditional operation
->; if p, then q; false if p is true and q is false
in p -> q…
p is the hypothesis and q is the conclusion
contrapositive
if notq, then notp
inverse
if notp, then notq
converse
if q, then p
biconditional operation
<->; p if and only if q; p iff q; only T if both are T or both are F
tautology
a compound proposition that is always true, regardless of individual propositions
contradiction
a compound proposition that is always false regardless of individual propositions
compund propositions are logically equivalent when
they have the same truth value; disregard individual/composing propositions
De Morgan’s laws
not (p or q) = not p and not q; not (p and q) = notp or not q
idempotent
p and p means p; p or p means p
associative
(p or q) or r = p or (q or r); p and (q and r) = (p and q) and r
commutative
p and/or q = q and/or p
distributive
p and (q or r) = (p or q) and (p and r)
identity
p or False = p; p and True = p
domination
p and False = False; p or True = True
double negation
not(not p) = p