click below
click below
Normal Size Small Size show me how
GEN MATH REVIEW
1ST SEM FINALS, 11-BLSD. GABRIELA
| Question | Answer |
|---|---|
| are declarative sentences that are either true or false, but not both. If a proposition is true, then its truth value is true, which is denoted by 𝑻; otherwise, its truth value is false, which is denoted by F | PROPOSITIONS |
| a proposition formed from a simpler proposition using logical connectors or some combination of logical connectors. Where <∙> stands for some proposition. A proposition is simple if it cannot be broken down any further into other component propositions. | COMPOUND PROPOSITIONS |
| Given a proposition, its truth table shows all its possible truth values. | LOGICAL OPERATORS |
| p is denoted by ~p (“not p”) and is defined through its truth table. | NEGATION |
| How is negation denoted? | ~p (“not p”) |
| 𝑝 and 𝑞 are denoted by 𝑝 ∧ 𝑞: (𝑝 and 𝑞) and are defined through their truth table. | CONJUNCTION |
| How is conjunction denoted? | 𝑝 ∧ 𝑞: (𝑝 and 𝑞) |
| 𝑝 and 𝑞 are denoted by 𝑝 ∨ 𝑞: (𝑝 or 𝑞) and are defined through their truth table. | DISJUNCTION |
| How is disjunction denoted? | 𝑝 ∨ 𝑞: (𝑝 or 𝑞) |
| 𝑝 and 𝑞 are denoted by 𝑝 → 𝑞: (If 𝑝, then 𝑞) and are defined through their truth table. | CONDITIONAL |
| How is conditional denoted? | 𝑝 → 𝑞: (If 𝑝, then 𝑞) |
| 𝑝 and 𝑞 are denoted by 𝑝 <-> 𝑞 (𝑝 if and only if 𝑞) and are defined through their truth table. | BICONDITIONAL |
| How is biconditional denoted? | 𝑝 <-> 𝑞 (𝑝 if and only if 𝑞) |
| What is the rule for negation? | It is opposite from the 'p'. |
| What is the rule for conjunction? | If there is false, then it will be false. unless both true, then it is true. |
| What is the rule for disjunction? | if there is true, then it is true, unless both are false, then it is false. |
| What is the rule for conditional? | dependent on q, if both false then it is true. |
| What is the rule for biconditional? | if there is false, then it is false, unless both true then true and when both false it is true. |