- Shuffle
Toggle OnToggle Off
- Alphabetize
Toggle OnToggle Off
- Front First
Toggle OnToggle Off
- Both Sides
Toggle OnToggle Off
Front
How to study your flashcards.
Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key
Up/Down arrow keys: Flip the card between the front and back.down keyup key
H key: Show hint (3rd side).h key
PLAY BUTTON
PLAY BUTTON
47 Cards in this Set
- Front
- Back
- 3rd side (hint)
|
Double Negation Law
|
- ( - p ) <=> p
|
|
|
Associative Laws (1)
|
( p \/ q ) \/ r <=>
|
p \/ ( q \/ r ) |
|
Associative Laws (2)
|
( p /\ q ) /\ r <=>
|
p /\ ( q /\ r ) |
|
Distributive Laws (1)
|
p \/ ( q /\ r ) <=>
|
( p \/ q ) /\ ( p \/ r ) |
|
Distributive Laws (2)
|
p /\ ( q \/ r ) <=>
|
( p /\ q ) \/ ( p /\ r ) |
|
Identity Laws (1)
|
p /\ T <=>
|
p |
|
Identity Laws (2)
|
p \/ F <=>
|
p |
|
Domination Laws (1)
|
p \/ T <=>
|
T |
|
Domination Laws (2)
|
p /\ F <=>
|
F |
|
Idempotent Laws (1)
|
p \/ p <=>
|
p |
|
Idempotent Laws (2)
|
p /\ p <=>
|
p |
|
Commutative Laws (1)
|
p \/ q <=>
|
q \/ p |
|
Commutative Laws (2)
|
p /\ q <=>
|
q /\ p |
|
De Morgan's Laws (1)
|
-( p /\ q ) <=>
|
-p \/ -q |
|
De Morgan's Laws (2)
|
-( p \/ q ) <=>
|
-p /\ -q |
|
Absorption Laws (1)
|
p \/ ( p /\ q ) <=>
|
p |
|
Absorption Laws (2)
|
p /\ ( p \/ q ) <=>
|
p |
|
Negation Laws (1)
|
p \/ -p <=>
|
T |
|
Negation Laws (2)
|
p /\ -p <=>
|
F |
|
Implication Rule
|
p -> q <=>
|
-p \/ q |
|
Contrapositive
|
p -> q <=>
|
-q -> -p |
|
Logical Equivalencies Involving Conditional Statements (3)
|
p \/ q <=>
|
-p -> q |
|
Logical Equivalencies Involving Conditional Statements (4)
|
p /\ q <=>
|
-( p -> -q ) |
|
Logical Equivalencies Involving Conditional Statements (5)
|
( p -> q ) /\ ( p -> r ) <=>
|
p -> ( q /\ r ) |
|
Logical Equivalencies Involving Conditional Statements (6)
|
( p -> q) /\ ( q -> r ) <=>
|
( p \/ q ) -> r |
|
Logical Equivalencies Involving Conditional Statements (7)
|
( p -> q ) \/ ( p -> r) <=>
|
p -> ( q \/ r ) |
|
Logical Equivalencies Involving Conditional Statements (8)
|
( p -> r ) \/ (q -> r ) <=>
|
( p /\ q ) -> r |
|
Logical Equivalencies Involving Biconditionals (1)
|
p <-> q <=>
|
(p -> q) /\ ( q -> p ) |
|
Logical Equivalencies Involving Biconditionals (2)
|
p <-> q <=>
|
-p <-> -q |
|
Logical Equivalencies Involving Biconditionals (3)
|
p <-> q <=>
|
( p /\ q ) \/ ( -p /\ -q ) |
|
Logical Equivalencies Involving Biconditionals (4)
|
-( p <-> q ) <=>
|
p <-> -q |
|
Truth Table XOR
|
p q
T T p xor q |
F |
|
Truth Table XOR
|
p q
T F p xor q |
T |
|
Truth Table XOR
|
p q
F T p xor q |
T |
|
Truth Table XOR
|
p q
F F p xor q |
F |
|
Truth Table Conditional Statement
|
p q
T T p-> q |
T |
|
Truth Table Conditional Statement
|
p q
T F p-> q |
F |
|
Truth Table Conditional Statement
|
p q
F T p-> q |
T |
|
Truth Table Conditional Statement
|
p q
F F p-> q |
T |
|
Truth Table for Biconditional
|
p q
T T p <-> q |
T |
|
Truth Table for Biconditional
|
p q
T F p <-> q |
F |
|
Truth Table for Biconditional
|
p q
F T p <-> q |
F |
|
Truth Table for Biconditional
|
p q
F F p <-> q |
T |
|
define :
Logically Equivalent |
p and q are logically equivalent if:
|
p <-> q is a tautology |
|
define :
Tautology |
a compound proposition that is always true, no matter the truth values of the propositions that occur in it
|
|
|
define :
Contradiction |
a compound proposition that is aways false
|
|
|
define :
Contingency |
a compound proposition that is neither a tautology nor a contradiction
|
