Busy. Please wait.

show password
Forgot Password?

Don't have an account?  Sign up 

Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.

By signing up, I agree to StudyStack's Terms of Service and Privacy Policy.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.

Remove ads
Don't know
remaining cards
To flip the current card, click it or press the Spacebar key.  To move the current card to one of the three colored boxes, click on the box.  You may also press the UP ARROW key to move the card to the "Know" box, the DOWN ARROW key to move the card to the "Don't know" box, or the RIGHT ARROW key to move the card to the Remaining box.  You may also click on the card displayed in any of the three boxes to bring that card back to the center.

Pass complete!

"Know" box contains:
Time elapsed:
restart all cards

Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

Pre-cal Logic

Flash Cards for Mrs. Wag's Logic Chapter

Mathematical Logic symbolic, Bertrand Russel & A. N. Whitehead (England Principia Mathematica)
Statement a sentence that states a fact or contains a complete idea. Can be judged T or F.
Negation ~ results in opposite truth values
Quantifiers some, all, one, none
~ Some “for some p” > “for all not p”
~ All “for all p” > “for some not p”
Conjunction p^q. 2 statements connected by “and”
Disjunction pvq. 2 statements connected by “or”
Conditional/Implication p > q.
Converse q > p.
Biconditional whenever both the conditional and converse are T, p and q have = T values.
Tautology compound statement that is always T regardless of the T values of its components. the biconditional of 2 = statements.
Logically Equivalent 2 statements that have the same T values.
Inverse ~p > ~q
Contrapositive ~q > ~p
Law of Detachment (def) if a conditional is T and its hypothesis is T, then its conclusion must be T
Law of Modus Tollens (def) if a conditional is T and its conclusion is F, then its hypothesis is F
Law of Contrapositive (def) if a conditional is T then its contrapositive is T
Law of Syllogism (def) if 2 given conditionals are T a 3rd using the hypothesis of the 1st and the conclusion of the 2nd is T
Law of Disjunctive Inference (def) if a disjunction is T and one of the disjuncts is F, then the other disjunct is T
Law of Disjunctive Addition (def) if a given statement is T then a disjunction involving that statement and any 2nd statement is T
Law of Simplification (def) if a conjunction is T then each of the conjuncts is T
Law of Conjunction (def) if two statements are T, the conjunction is T
Negation of Conjunction (def) the negation of a conjunction = the disjunction of the negation of each statement
Negation of Disjunction (def) the negation of a disjunction of two statements = the conjunction of the negation of each statement
Law of Double Negation (def) the negation of the negation statement is = to the statement
Invalid Reasoning (Asserting the Conclusion) if a conditional is T and its conclusion is T then its hypothesis is not necessarily T
Invalid Reasoning (Denying the Premise) if a conditional is T and its hypothesis is false then its conclusion is not necessarily F.
Law of Contrapositive (argument)
Law of Detachment (argument)
Law of Modus Tollens (argument)
Law of Syllogism (argument)
Law of Disjunctive Inference (argument)
Law of Disjunctive Addition (argument)
Law of Simplification (argument)
Law of Conjunction (argument)
Law of Double Negation (argument)
Negation of a Conjunction (argument)
Negation of a Disjunction (argument)
Invalid Reasoning, Asserting the Conclusion (argument)
Invalid Reasoning, Denying the Premise (argument)
Created by: YellowDucks