Welcome to the World of "Logic"
Hello, Grade 10 students! Have you ever wondered why we can immediately say some sentences are "true" or "false," yet we argue endlessly about others? Logic will help you develop a more systematic and rational way of thinking, allowing you to analyze sentences and conditions with the precision of a computer!
If you feel like this subject is full of strange symbols, don't worry! We will decode them together step-by-step in a simple way.
1. What is a Statement?
A statement is a declarative sentence that can be clearly classified as either "True (T)" or "False (F)," but not both.
Let's look at some examples:
- "2 + 2 = 4" -> Is a statement (because we can determine it is True)
- "Chiang Mai is the capital of Thailand" -> Is a statement (because we can determine it is False)
- "Have you eaten yet?" -> Not a statement (because it is a question; it cannot be labeled as true or false)
- "Wow! That's beautiful." -> Not a statement (because it is an exclamation/expression of feeling)
Key Point: Sentences that are commands, questions, requests, or expressions of personal opinion are not statements.
2. Logical Connectives
In real life, we rarely speak in single sentences. We often use conjunctions like "and," "or," and "if...then..." to connect ideas. In mathematics, we have specific symbols to represent these words.
1) AND: Represented by the symbol \( \land \)
Think of strict rules: "To pass the class, you must attend class AND submit your assignments."
If you fail to do either one, you don't pass!
Golden Rule: It is True (T) only if both parts are True.
2) OR: Represented by the symbol \( \lor \)
Think of being flexible: "This evening, we can have rice OR noodles."
If we have either one, we are happy!
Golden Rule: It is False (F) only if both parts are False.
3) IF...THEN...: Represented by the symbol \( \rightarrow \)
Think of a "promise": "If you get an A grade, then I will buy you a game."
I only break my promise (it becomes false) in one specific case: You got an A (front is True) but I did not buy the game (back is False).
Golden Rule: \( T \rightarrow F \) is F; otherwise, it is always T.
4) IF AND ONLY IF: Represented by the symbol \( \leftrightarrow \)
Think of a "mirror": Both sides must be exactly the same to be true.
Golden Rule: Same values equal T (T-T or F-F), different values equal F.
5) NOT: Represented by the symbol \( \sim \)
This adds "not" to the sentence, flipping the truth value to its opposite.
For example, if \( P \) is true, then \( \sim P \) is immediately false.
Did you know? A simple way to remember \( \rightarrow \) is: "True front, False back equals False," and everything else is true!
3. Truth Tables
When you have many connected statements, creating a table helps you see the big picture clearly.
Table Creation Technique:
1. If there are \( n \) statements, there will be \( 2^n \) total cases.
2. For example, with 2 statements (\( P, Q \)), there are \( 2^2 = 4 \) cases (T-T, T-F, F-T, F-F).
Common Mistakes: Students often forget to list all possible combinations or confuse the symbols \( \land \) (AND) and \( \lor \) (OR). Remember that \( \land \) looks like an A (for And), while \( \lor \) looks like a bag mouth opening to catch anything (Or).
4. Equivalence
Equivalence (\( \equiv \)) means two sets of statements have the exact same truth values in every case. It's like saying the same thing using different words.
Frequently Used Equivalence Formulas (Must memorize!):
1. Associative Law: \( (P \land Q) \land R \equiv P \land (Q \land R) \)
2. De Morgan's Laws: \( \sim(P \land Q) \equiv \sim P \lor \sim Q \) (Distribute the \( \sim \) and flip the operator)
3. Conditional Formula: \( P \rightarrow Q \equiv \sim P \lor Q \) (This one appears in exams the most!)
5. Tautology
A tautology is a logical structure that is "True (T)" in every possible case, regardless of the truth values of the sub-statements.
The Pro Way to Check for Tautology:
Instead of building a long table, use the "Find a Contradiction" method:
Assume the statement is False (F) and try to solve for the values. If you run into a contradiction, it means the statement cannot possibly be false—therefore, it is a tautology.
Key Point: If the question asks if \( P \rightarrow Q \) is a tautology, try assuming the front is T and the back is F, then see if it leads to a contradiction.
Summary
Logic in Grade 10 isn't about heavy arithmetic; it's about "conditions" and "relationships."
- Statements are sentences that are clearly true or false.
- Connectives consist of 5 main symbols (\( \land, \lor, \rightarrow, \leftrightarrow, \sim \)).
- Equivalence means different looks but identical truth meanings.
- Tautology means it is always true without exception.
If it feels difficult at first, don't worry! Try practicing different problems, and you will start to see the patterns yourself. Logic is like solving a spot-the-difference game; the more you practice, the faster you get! Keep it up!