Test 1 (1.1- 2.2) Flashcards
(35 cards)
“Z”
-3,-2,-1,0,1,2,3… Integers
“N”
1,2,3,4,5… Natural (counting) numbers
“Q”
set of rational numbers
“R”
set of real numbers
p –> q
p
————
q
modus ponens
p –> q
(not) q
- ———–
(not) p
modus tollens
p –> q
q –> r
————
p –> r
transitivity
p or q
(not) p
————
q
disjunctive syllogism
p –> q
(not) p
- ———–
(not) q
*fallacy of denying the antecedent (argument ignores some possibilities)
Discrete
finite answers
continuous
variable answers
statement (proposition)
a sentence that can be identified as true or false
open sentence
would be identifiable if the variable was defined
compound statement
new statement formed from simpler propositions using connectives
conjunction
statement formed from p and q using AND
disjunction
2 propositions formed by OR
negation
the negation of p is not p
logical contradiction
fake under all conditions
tautology
true under all conditions
not (p and q) ===== not p or not q
not (p or q) ===== not p and not q
DeMorgan’s Laws
conditional
if p then q
- variations on the conditional (p –> q):
q –> p
converse
- variations on the conditional (p –> q):
not q –> not p
contrapositive
- variations on the conditional (p –> q):
not p –> not q
inverse