Chapter 1 - The Foundations: Logic and Proofs Flashcards
¬ p (negation of p)
th proposition with truth value opposite to the truth value of p
compound propositions
a proposition constructed by combining propositions using logical operators
p ⋎ q (disjunction of p and q)
the proposition “p or q,” which is true if and only if at least one of p and q is true
p ⋏ q (conjunction of p and q)
the proposition “p and q,” which is true if and only of both p and q are true
p → q (p implies q)
the proposition “if p, then q,” which is false if and only of p is true and q is false
converse of p → q
the conditional statement q → p
contrapositive of p → q
the conditional statement ¬q → ¬p
inverse of p → q
the conditional statement ¬p → ¬q
p ⇄ q (biconditional)
the proposition “p if and only if q,” which is true if and only if p and q have the same truth value
bit
either a 0 or 1
Boolean variable
a variavle that has a value of 0 or 1
tautology
a compound proposition that is always true
contradiction
a compound proposition that is always false
contingency
a compound proposition that is sometimes true and sometimes false
logically equivalent
compound propositions that always have the same truth values
propositional function
a statement containing one or more variables that becomes a proposition when each of its variables is assignrd a value or is bound by a quantifier
domain (or universe) of discourse
the values a variable in a propositional function may take
∃xP(x) (existential quantification of P(x))
There exists
∀xP(x) (universal quantification of P(x))
For all
logically equivalent expressions
Both arguments have the same meaning
valid argument
an argument with a valid argument form
fallacy
an invalid argument form often used incorrectly as a rule of inference (or sometimes, more generally, an incorrect argument)
proof by contraposition
a proof that p → q is true that proceeds by showing that p must be false when q is false
proof by contradiction
a proof that p is true based on the truth of the conditional statement ¬p → ¬q, where q is a contradiction