Across
- 3. An unproven statement or rule that is based on inductive reasoning
- 5. The inverse is obtained by negating both the hypothesis and the conclusion of a conditional. The inverse of the conditional "if p, then q" is the conditional "if not p, then not q."
- 6. bisector: A ray that divides an angel into two congruent angels.
- 7. Proof: A proof is a convincing argument that uses deductive reasoning to demonstrate the truth of a statement. It can be presented in various forms, such as two-column, paragraph, flow, coordinate, or indirect proofs.
- 10. reasoning: Deductive reasoning is a process of reasoning using given and previously known facts to reach a logical conclusion
- 11. combination of a conditional statement ,p-> q , and its converse q->p. A biconditional contains the words “if and only if “
- 14. if-then statement that relates a hypothesis, the part that follows if, to a conclusion, the part the follows then.
Down
- 1. reasoning: Inductive reasoning is a type of reasoning that reaches conclusions based on a pattern of specific examples or past events.
- 2. A counterexample is an example that shows a statement or conjecture is false.
- 4. geometric figure made with only a straightedge and compass
- 6. Negation: The opposite meaning of a statement.
- 8. The contrapositive is created by negating and reversing a conditional statement. For "if p, then q," the contrapositive is "if not q, then not p." They have the same truth value.
- 9. Law of syllogism: The Law of Syllogism is a law of logic that states that given two true conditionals with the conclusion of the first being the hypothesis of the second, there exists a third true conditional having the hypothesis of the first and the conclusion of the second. Symbolically, if p → q and q → r are true, then p → r is true.
- 12. The converse reverses the hypothesis and conclusion of a conditional.
- 13. of detachment: The Law of Detachment is a law of logic that states if a conditional statement and its hypothesis are true, then its conclusion is also true. Symbolically, if p → an and p are true, then q is true.
