Critical thinking is a cognitive process that involves evaluating information, analyzing arguments, and making reasoned judgments. It is a way of thinking that goes beyond simply accepting information at face value and instead encourages individuals to question assumptions, consider multiple perspectives, and apply logical reasoning to arrive at well-reasoned conclusions.
At its core, critical thinking is about using evidence and reason to assess the validity of claims and arguments. This process involves a number of different skills, including:
1. Analysis: The ability to break down complex information into smaller parts and evaluate the relationships between those parts.
2. Interpretation: The ability to understand and explain the meaning of information and draw inferences from that information.
3. Evaluation: The ability to assess the quality and credibility of information and arguments, taking into account factors such as bias, context, and evidence.
4. Inference: The ability to draw conclusions based on available evidence and reasoning.
5. Explanation: The ability to articulate and justify one’s reasoning and conclusions, using clear and concise language.
6. Self-regulation: The ability to monitor one’s own thinking, identify and address biases, and make adjustments as needed.
Critical thinking is important in a variety of contexts, including academic, professional, and personal. In academic settings, critical thinking is essential for evaluating sources and conducting research, as well as for analyzing complex texts and arguments. In professional settings, critical thinking is important for problem-solving, decision-making, and evaluating the effectiveness of strategies and policies. In personal contexts, critical thinking is important for making informed decisions, assessing the credibility of information, and engaging in productive conversations and debates.
One of the key challenges of critical thinking is that it requires individuals to be open-minded and willing to consider multiple perspectives. This can be difficult, particularly when faced with information or arguments that challenge one’s existing beliefs or values. However, critical thinking is essential for developing a well-rounded understanding of complex issues and for making informed decisions that are based on evidence and reason.
There are a number of strategies and techniques that can be used to promote critical thinking, including:
1. Asking questions: Encouraging individuals to ask questions about information and arguments can help them to clarify their thinking, identify assumptions and biases, and evaluate the credibility of sources.
2. Considering multiple perspectives: Encouraging individuals to consider multiple perspectives on an issue can help them to develop a more nuanced understanding of complex issues and to identify areas of agreement and disagreement.
3. Evaluating evidence: Encouraging individuals to evaluate the quality and relevance of evidence can help them to distinguish between credible and unreliable sources of information.
4. Recognizing bias: Encouraging individuals to recognize their own biases and to consider the biases of others can help them to evaluate arguments more objectively and to avoid making assumptions based on preconceived notions.
5. Engaging in argumentation: Encouraging individuals to engage in productive debates and discussions can help them to develop their critical thinking skills by allowing them to practice evaluating arguments and identifying flaws in reasoning.
In conclusion, critical thinking is a cognitive process that involves evaluating information, analyzing arguments, and making reasoned judgments. It is a way of thinking that goes beyond simply accepting information at face value and instead encourages individuals to question assumptions, consider multiple perspectives, and apply logical reasoning to arrive at well-reasoned conclusions. Critical thinking is important in a variety of contexts and can be promoted through a range of strategies and techniques, including asking questions, considering multiple perspectives, evaluating evidence, recognizing bias, and engaging in argumentation.
Searching for budget-friendly accommodations at Panglao Island, Bohol? Discover Residence 2 at Belle’s Residences—a cozy retreat designed for comfort and relaxation. Conveniently located near Panglao’s stunning beaches, this residence offers modern amenities at an unbeatable value.
Categorical logic is a branch of logic that deals with propositions that relate classes or categories of objects. It was developed by the ancient Greek philosopher Aristotle and has been studied and refined by philosophers, logicians, and mathematicians over the centuries. Categorical logic is a fundamental part of classical logic and provides the basis for many other areas of logic.
The basic elements of categorical logic are terms, propositions, and syllogisms. A term is a word or group of words that refers to a class or category of objects. For example, “dog” is a term that refers to the category of animals that we call dogs. A proposition is a statement that asserts something about a class or category of objects. For example, “All dogs are mammals” is a proposition that asserts that the category of dogs is a subset of the category of mammals. A syllogism is an argument that consists of two premises and a conclusion, where the conclusion follows logically from the premises.
Categorical logic divides terms into four basic types, which are called categories or classes. These categories are based on the quantity and quality of the terms. The four categories are:
Universal affirmative (A): This category includes propositions that assert that all members of a category have a certain property. For example, “All dogs are mammals.”
Universal negative (E): This category includes propositions that assert that no members of a category have a certain property. For example, “No dogs are reptiles.”
Particular affirmative (I): This category includes propositions that assert that some members of a category have a certain property. For example, “Some dogs are friendly.”
Particular negative (O): This category includes propositions that assert that some members of a category do not have a certain property. For example, “Some dogs are not black.”
The letters A, E, I, and O are used to represent these four categories in categorical logic.
Categorical logic also distinguishes between two types of relationships between categories: inclusion and exclusion. Inclusion is a relationship between two categories where one is a subset of the other. For example, the category of dogs is included in the category of mammals. Exclusion is a relationship between two categories where they have no members in common. For example, the category of dogs is excluded from the category of reptiles.
The basic principles of categorical logic are the laws of contradiction, contrariety, and subcontrariety. The law of contradiction states that a proposition and its negation cannot both be true at the same time. For example, “All dogs are mammals” and “No dogs are mammals” cannot both be true. The law of contrariety states that two propositions of opposite quality cannot both be true. For example, “All dogs are friendly” and “No dogs are friendly” cannot both be true. The law of subcontrariety states that two propositions of opposite quantity can both be true, but they cannot both be false. For example, “Some dogs are friendly” and “Some dogs are not friendly” can both be true, but they cannot both be false.
Categorical logic also provides rules for syllogisms, which are arguments that consist of two premises and a conclusion. A syllogism must have three terms: the major term, the minor term, and the middle term. The major term is the predicate of the conclusion, the minor term is the subject of the conclusion, and the middle term appears in both premises but not in the conclusion. The three terms must be related in a specific way: the middle term must be related to the major and minor terms in such a way that the conclusion follows logically from the premises.
There are several types of syllogisms in categorical logic, based on the quantity and quality of the premises and the conclusion. These syllogisms are categorized by letters that represent their form, such as AAA, EIO, etc.
One of the most basic types of syllogisms is the categorical syllogism, which consists of two premises and a conclusion, each of which is a categorical proposition. A categorical proposition asserts something about a category or class of objects, and is either affirmative or negative in quality, and either universal or particular in quantity.
The four types of categorical propositions are represented by the letters A, E, I, and O. An A proposition is a universal affirmative proposition, such as “All cats are mammals”. An E proposition is a universal negative proposition, such as “No cats are reptiles”. An I proposition is a particular affirmative proposition, such as “Some cats are friendly”. An O proposition is a particular negative proposition, such as “Some cats are not black”.
A categorical syllogism consists of two premises and a conclusion, each of which is one of these four types of propositions. The form of a categorical syllogism is represented by three letters, which stand for the three terms used in the syllogism. The major term is the predicate of the conclusion, the minor term is the subject of the conclusion, and the middle term is the term that appears in both premises but not in the conclusion.
One of the most common types of syllogisms is the mood-A syllogism, which has two A propositions and one I proposition. For example, “All men are mortal. All Greeks are men. Therefore, all Greeks are mortal.” This syllogism is valid, meaning that the conclusion necessarily follows from the premises.
Another common type of syllogism is the mood-E syllogism, which has two E propositions and one O proposition. For example, “No dogs are cats. Some animals are not cats. Therefore, some animals are not dogs.” This syllogism is also valid.
The mood-I syllogism has two I propositions and one A proposition. For example, “Some birds can fly. Some penguins are birds. Therefore, some penguins can fly.” This syllogism is valid.
The mood-O syllogism has two O propositions and one E proposition. For example, “Some dogs are not black. Some dogs are not brown. Therefore, some dogs are not both black and brown.” This syllogism is valid.
There are other types of syllogisms in categorical logic, including the Baroco, Bocardo, Cesare, Darii, Ferio, and Festino syllogisms. Each of these syllogisms has a specific form and specific rules for validity.
In conclusion, categorical logic provides a framework for analyzing arguments that involve categories or classes of objects. Syllogisms are a key part of this framework, and come in several different types, each with its own form and rules for validity. Understanding these types of syllogisms can help us to analyze and evaluate arguments more effectively.
In these notes, I will briefly discuss tautologies and contradictions in propositional or symbolic logic. But please note that this is just an introductory discussion on tautologies and contradictions as my main intention here is just to make students in logic become familiar with the topic under investigation.
On the one hand, a tautology is defined as a propositional formula that is true under any circumstance. In other words, a propositional expression is a tautology if and only if for all possible assignments of truth values to its variables its truth value is always true.
Thus, a tautology is a proposition that is always true. Consider the following example:
Either the accused is guilty or the accused is not guilty. (p)
Obviously, the proposition is a disjunction; yet both disjuncts can be represented by the variable p. Hence, the proposition is symbolized as follows:
pv~p
Now, in what sense that this proposition is always true? The truth table below will prove this point.
As we can see in the truth table above, if p is true, then ~p is false; and if p is false, then ~p is true. And if we apply the rules in both inclusive and exclusive disjunction, the result of pv~p is always true. If we recall our discussion on inclusive and exclusive disjunction, we learned that an inclusive disjunction is true if at least one of the disjuncts is true; and an exclusive disjunction is true if one disjunct is true and the other is false, or one disjunct is false and the other is true.
Hence, there is no way that pv~p will become false. Indeed, the propositional form pv~p is always true.
On the other hand, a contradiction is defined as a propositional formula that is always false under any circumstance. In other words, a propositional expression is a contradiction if and only if for all possible assignments of truth values to its variables its truth value is always false. Thus, again, a contradiction is a proposition that is always false. Let us consider the examples below.
Man is both mortal and immortal. (p)
Obviously, the proposition is a conjunction; yet both conjuncts can be represented by the variable p. Hence, the proposition is symbolized as follows:
p • ~p
Now, in what sense that this proposition is always false? The truth table below will prove this point.
As we can see in the truth table above, if p is true, then ~p is false; and if p is false, then ~p is true. And if we apply the rule in conjunction here, which says that “A conjunction is true if and only if both conjuncts are true,” then surely there is no way that the proposition “Man is both mortal and immortal” or p•~p will become true. Indeed, the propositional form p•~p is always false.
In these notes, I will discuss the indirect truth table method in determining the validity of an argument in symbolic logic.
In my other notes (look for “Propositional Logic: Truth Table and Validity of Arguments” in Studypool search engine), I discussed the truth table method in determining the validity of an argument in symbolic logic. But the problem of the truth table method is that it can hardly be used in determining the validity of longer arguments.
Consider the example below.
If the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth, then the captain either had good motives for controlling the world or his motives were evil. The airship Albatros had powerful weapon only if its captain had more advanced scientific knowledge than his contemporaries; and if the captain had more advanced scientific knowledge than his contemporaries, then Albatros could destroy objects on the ground. It is either the case that if the Albatros could destroy objects on the ground its captain could enforce his will all over the earth, or it is the case that if he attempted to blow up the British vessel then his passengers would recognize the hoax. It is not the case that his attempt to Blow up the British vessel resulted in his passengers’ recognizing the hoax. Furthermore, the captain’s motives for controlling the world were not evil. Therefore, his motives were good. (A, D, W, G, E, S, B, P)
As we can see, the argument contains 8 constants, namely, A, D, W, G, E, S, B, and P. If we employ the truth table method in determining the validity of this argument, then this means that we need to construct a truth table that contains 256 rows. Needless to say, that’s going to be a long and arduous process. It is for this obvious reason that logicians invented a shorter, more efficient method of determining the validity of arguments, namely, the indirect truth table method.
Let us determine the validity of the argument above using the indirect truth table method.
If the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth, then the captain either had good motives for controlling the world or his motives were evil.
[(A ⊃ D) • (D ⊃ W)] ⊃ (Gv E)
Proposition 2:
The airship Albatros had powerful weapon only if its captain had more advanced scientific knowledge than his contemporaries; and if the captain had more advanced scientific knowledge than his contemporaries, then Albatros could destroy objects on the ground.
(A ⊃ S) • (S ⊃ D)
Proposition 3:
It is either the case that if the Albatros could destroy objects on the ground its captain could enforce his will all over the earth, or it is the case that if he attempted to blow up the British vessel then his passengers would recognize the hoax.
(D ⊃ W) v (B ⊃ P)
Proposition 4:
It is not the case that his attempt to Blow up the British vessel resulted in his passengers’ recognizing the hoax.
~ (B ⊃ P)
Proposition 5:
Furthermore, the captain’s motives for controlling the world were not evil.
~ E
Conclusion:
Therefore, his motives were good.
/∴ G
In the end, the argument above is symbolized as follows:
Now, in determining the validity of the argument above using the indirect truth table method, what we need to do is try to make the conclusion false and all the premises true. This is because if we recall our discussion on the rule in determining the validity of an argument in symbolic logic, we learned that an argument is invalidif the conclusion is false and all the premises are true. Thus, in using the indirect truth table method in determining the validity of an argument, we aim to make the argument invalid. If it is possible for us to make the argument invalid, then obviously the argument is invalid. If it is impossible for us to make the argument invalid, then obviously the argument is valid.
But how do we make the argument invalid?
First, let’s write the premises and the conclusion in a horizontal manner for convenience’s sake.
And second, assign truth-values to the conclusion and the premises that would result in the form “false conclusion and all true premises”. In doing so, start with the conclusion and assign the value “false”, and then go back to the premises and try to make all of them true. In making the premises true, always start with the first premise in order to avoid confusion and, of course, save time. Consider the example below.
As we can see, the argument above is valid because, although the conclusion is false, we cannot make all of the premises true. No matter what we do, Premise #5 cannot be true. Let me explain this further.
As said, let us always start with the conclusion and assign a false value to it. Please note that we should not assign a true value to the conclusion because if we do so, then we are defeating the purpose. This is obviously because if we assign the value true for the conclusion, then the argument will already appear valid. So, again, we should assign the value false for the conclusion. Look at the illustration below.
Please note that in this example, we can easily make the conclusion false by assigning the truth-value “false” to it because the conclusion above is a simple proposition. But even if it’s a compound proposition, we can still easily make it false if we have mastered the rules in compound propositions in symbolic logic. For example, if the conclusion is p ⊃q, then we just need to assign the value true for p and false for q to make the proposition (conclusion) false. If we recall, the conditional proposition is false if the antecedent is true and the consequent false.
Now, since we have made the conclusion false, let’s go back to the premises and try to make all of them true. And let’s start with the first premise. Look at the illustration below.
As we can see, the first premise is a conditional proposition whose antecedent is [(A ⊃ D) • (D ⊃ W)] and the consequent is (G v E). Because this is a conditional proposition, and since our goal here is to make this premise true, then all we need to do is assign truth-values that would make the consequent (G v E) true. Please note that we need not assign any values to the antecedent [(A ⊃ D) • (D ⊃ W)] because whatever its truth-value, the premise is already true since the consequent is true. Again, the only instance wherein the conditional proposition becomes false is when the antecedent is true and the consequent false. Thus, whenever the antecedent is false or the consequent is true, the conditional proposition becomes automatically true.
So, how do we make the consequent (G v E) true?
Since the consequent is an exclusive disjunctive, then we need to see to it that (G v E) should not have the same truth-value in order for it to become true. If we recall our discussion in exclusive disjunction, an exclusive disjunction is true if one disjunct is false and other is true, and vice versa. And since we already have the value false for G in the conclusion, then we cannot make it true in the premise. Please note that in indirect truth table method, once the variable or constant has a fixed truth-value, then we cannot change it. Thus, if we change the truth-value of one variable or constant, then we need to change the truth-value of the same variable or constant in the entire indirect truth table. Since G is false, then we are forced to assign the truth-value “true” for E to make (G v E) true. So, since G is false and E is true, then the exclusive disjunction (G v E) is now true. And since the proposition is a conditional one, and because the consequent (G v E) is true, then Premise #1 is now true.
Let’s proceed to the second premise and try to make it true. Look at the illustration below.
Premise #2 is a conjunctive statement whose conjuncts are both conditional propositions. If we recall our discussion on conjunctive statements, we learned that a conjunctive statement is true if both conjuncts are true. Hence, if one conjunct or both are false, then the conjunctive statement is false. Since our goal here is to make Premise #2 true, then we have to see to it that both conjuncts must be true. In other words, (A ⊃S) and (S⊃D) must be true.
How do we make (A ⊃S) and (S⊃D) true?
Let’s start with (A ⊃S). Since we don’t have a value for A and S yet, then we are free to assign whatever value that will make (A ⊃S) true. So, if we assign a true value for both A and S, then (A ⊃S) is true. Hence, as you can see in the diagram above, A is true and S is true.
The second conjunct is (S⊃D). Please note that we already have a value for S, which is true. Hence, we cannot assign a false value to D because it will make the proposition false. So, we are forced to assign the value true for D. Since S and D are now true, then the proposition (S⊃D) is true.
And since the conjuncts (A ⊃S) and (S⊃D) are now true, then Premise #2 is now true (see diagram above).
Let’s proceed to Premise #3. Look at the illustration below.
Premise #3 is an inclusive disjunction whose disjuncts are both conditional propositions. If we recall our discussion on inclusive disjunction, we learned that an inclusive disjunction is true if at least one of the disjuncts is true. So, in Premise #3, we just need to make either of the disjuncts true in order for it to become true. And in the illustration above, we just made the first disjunct (D ⊃ W) true.
How do we make the first disjunct (D ⊃ W) true?
Since we already have the value true for D (see Premise #2), and since the proposition is conditional, that is, (D ⊃ W), then we cannot assign a value false for W; otherwise, we are making the proposition false. Hence, we are forced to assign the value true for W. Now, Since D is true and W is true, then the first disjunct (D ⊃ W) is true. If we look at the illustration above, we do not assign a value to the second disjunct (B ⊃ P). Of course, we are free to assign a value for (B ⊃ P), but that is not necessary because whatever value we have for (B ⊃ P), the premise (D ⊃ W) v (B ⊃ P) is already true because the first disjunct is true.
Let’s proceed to Premise #4. Look at the illustration below.
Premise #4 is a conditional proposition, but it is completely negated. In this case, it is relatively easy for us to make this premise true. All we need to do is make B ⊃ P false; so that if B ⊃ P is false, then ~ (B ⊃ P) is true.
How do we make B ⊃ P false?
Because B ⊃ P is a conditional proposition, there is only one way to make it false, that is, assign a true value to the antecedent B and false to consequent P. If we recall our discussion on conditional propositions, we learned that a conditional is false if the antecedent is true and the consequent false. Hence, if B is true and P is false (see illustration above), then B ⊃ P false. Again, since B ⊃ P false, then ~ (B ⊃ P) is true (see illustration above).
Lastly, let us make Premise #5 true. Look at the illustration below.
Premise #5, as we can see, is just a simple proposition. So, it is very easy for us to make this premise true. Since the premise is ~ E, all we need to do is assign the value false for E. This is because if E is false, then ~ E is true.
However, if we go back to Premise #1, we notice that we have assigned the value true for E. And since in indirect truth table method we are not allowed to change the value of a variable or constant, then we are forced to use the value true for E in Premise #5. So, if E is true, then ~ E is false (see illustration above).
At the end of it all, it’s impossible for us to make the argument above invalid. Therefore, the argument is absolutely valid.
Just a final note. There are, of course, several ways of making a conclusion false and all the premises true in indirect truth table method. For example, we can make Premise #1 in the argument above by making the antecedent [(A ⊃ D) • (D ⊃ W)] false. But I have exhausted all the ways in making the argument above invalid but to no avail. The argument, therefore, is valid.
In these notes, I will discuss the topic truth table and validity of arguments, that is, I will discuss how to determine the validity of an argument in propositional logic using the truth table method.
However, it must be noted that there are two basic methods in determining the validity of an argument in symbolic logic, namely, truth table and partial truth table method. Again, in this post, I will only discuss the truth table method, thus the topic “truth table and validity of arguments”. I will discuss the partial truth table method in my next post.
Validity and Invalidity of Arguments
How do we know whether an argument is valid or invalid?
On the one hand, a truth-functionally valid argument form is an argument that is composed of propositions that have truth-functional forms such that it is impossible for its premises to be all true and its conclusion false. In other words,an argument is valid if it does not contain the form “all true premises and false conclusion”.
On the other hand, a truth-functionally invalid argument form is an argument that is composed of propositions that have truth-functional forms such that it is possible for its premises to be all true and its conclusion false. In other words, an argument is invalid if all of its premises are true and its conclusion false.
Let’s consider the example below.
1. If the squatters settle here, then the cattlemen will be angry and that there will be a fight for water rights. The squatters are going to settle here. Therefore, there will be a fight for water rights. (S, C, F)
So, how do we determine the validity of the argument above?
Before we can apply the truth table method in determining the validity of the argument above, we need to symbolize the argument first. After symbolizing the argument, we will construct a truth table for the argument, and then apply the rule in determining the validity of arguments in symbolic logic.
In symbolizing arguments in symbolic logic, we just need to apply the techniques that we employed in symbolizing propositions. Hence, we symbolize arguments in symbolic logic proposition by proposition or sentence by sentence.
Now, if we look at the argument above, the first proposition is “If the squatters settle here, then the cattlemen will be angry and that there will be a fight for water rights.” And then we see the constants “S, C, and F” at the end of the argument.
If we recall my discussion on symbolizing propositions, we learned that the variables or constants provided after the proposition (argument in this case) represent the propositions in the entire proposition (argument in this case) respectively. Hence, the constant S stands for “The squatters settle here”, C for “The cattlemen will be angry”, and F for “There will be a fight for water rights”. Thus, the first proposition “If the squatters settle here, then the cattlemen will be angry and that there will be a fight for water rights” is symbolized as follows:
S ⊃ (C•F)
The next proposition in the argument above says “The squatters are going to settle here”. As we notice, this proposition is just a repeat of the proposition in the previous statement, and this proposition is symbolized by the constant S. Hence, the second proposition “The squatters are going to settle here” is symbolized as follows:
S
The third and last proposition is obviously the conclusion because of the signifier “therefore”. This proposition is also a repeat of the proposition in the first sentence, which is symbolized by the constant F. Hence, the conclusion “Therefore, there will be a fight for water rights” is symbolized as follows:
F
At the end of it all, the argument “If the squatters settle here, then the cattlemen will be angry and that there will be a fight for water rights. The squatters are going to settle here. Therefore, there will be a fight for water rights. (S, C, F)” is symbolized as follows:
S ⊃ (C•F) S /∴F
Please note that in the symbolized form of the argument above, S ⊃ (C•F) is the first premise, S is the second premise, and F is the conclusion.
Now, how do we construct a truth table for this argument?
First, we need to construct a truth table that contains columns for the variables or constants and columns for the premises and the conclusion. In order to do this, we will use the formula 2 raised to the power n (2n), where 2 is constant and n is a variable.
The n in the formula 2n represents the number of variables or constants used in the argument. Since the argument above contains 3 constants, namely, S, C, and F, then the formula now reads:
23
So, 23 = 8. This means that we need to construct a truth table that contains 8 rows. But first we have to draw columns for the constants and the premises and the conclusion, which will look like this:
After drawing the columns for the constants and the premises and conclusion, we will now draw 8 rows. With this, the truth table will now look like this:
Now that we have constructed the truth table that contains the columns for the constants and the premises and conclusion, let us provide the truth values of the variables S, C, and F. We need to do this because the truth values of the premises and the conclusion will be based on the truth values of the variables or constants.
But how do we do this?
First, it must be noted that the product 8 above (23 = 8) also represents 4 true values and 4 false values for the variable or constant (S in the case of the example above). And the rule here is that we write the true values first and then the false values. So, the truth table will now look like this:
For the next column (that is, the column for C), we need to divide the 4 true and false values by 2. Thus, we will have 2 true values and 2 false values. The rule is we will write 2 true values first and then 2 false values. For the remaining rows, we will write 2 true values and 2 false values alternately. So, the truth table will now look like this:
For the next column (that is, the column for F), we need to divide the 2 true and false values by 2. Thus, we will have 1 true and 1 false value. The rule is we will write 1 true value first and then 1 false value. So, the truth table will now look like this:
For the remaining rows, we will write 1 true value and 1 false value alternately. So, the truth table will now look like this:
Since we already have the truth values of the constants S, C, F, we can now determine the truth values of the premises and the conclusion. Please note that we need to provide the truth values of all the premises and the conclusion before we can apply the rule in determining the validity of an argument. So, let’s provide the truth values of the premise.
The first premise is S ⊃ (C • F). As we can see, the first premise is a conditional proposition whose consequent is a conjunction. We also need to remember that in determining the truth value of this premise, we need to apply the rules in conditional and conjunctive propositions. If one does not know yet the rule in conditional propositions, one may visit our previous post titled “Conditional Propositions”, http://philonotes.com/index.php/2018/02/11/conditional-propositions/. And for the rule in conjunctive statements, please see “Conjunctive Statement”, http://philonotes.com/index.php/2018/02/03/conjunctive-statements/.
Now, before we can apply the rule in conditional proposition in the premise S ⊃ (C • F), we need to simplify first the consequent (C • F). This can be done my determining its truth value using the rule in conjunction. Since the rule in conjunction says “A conjunction is true if both conjuncts are true”, then the truth table will now partially look like this:
Please note that in the truth table above, I temporarily removed the column for S to avoid confusion, that is, in order to show that we are just using the values for the columns C and F.
Since we have already simplified (C • F), then we can now proceed to determining the final truth values of the first premise S ⊃ (C • F). So, the truth table will now look like this:
Please note that the final truth values of the first premise S ⊃ (C • F) are the ones in bold red. Let me illustrate how I arrived at those values. But let me just illustrate the first two rows. In the first row, S is true, C is true and F is true. So,
In the second row, S is true, C is true, and F is false. So,
For the truth values of the second premise which is S, we just need to copy the truth values of S in the first column. This is obviously because the second premise is a simple proposition. So, the truth table will now look like this:
For the truth values of the conclusion which is F, we just need to copy the truth values of F in the third column. This is obviously because the conclusion is a simple proposition. So, the truth table will now look like this:
As we can see, the truth table is now complete. So, we may now apply the rules in determining the validity of arguments in symbolic logic. But before we proceed to that, let us remove the columns for the variables in order to avoid confusion. It must be remembered that the rule talks about the premises and the conclusion only, and so we may now drop them. Of course, as we can see, the columns for the variables/constants are needed only in determining the truth values of the premises and conclusion. So, the truth table of the argument above will finally look like this:
If we recall, the rule in determining the validity of an argument in symbolic logic says that an argument is valid if it does not contain the form “all true premises and false conclusion” and an argument is invalid if “all of its premises are true and its conclusion false”. Please note that in applying the rule, we need to consider all rows in the truth table.
Now, the easiest and most convenient way to do it is to look for an invalid form in each row, that is, a row that contains all true premises and a false conclusion. Thus, if we cannot find one, then the argument is obviously valid.
If we look at the final truth table of the argument above, we cannot find at least one row that contains the form all true premises and a false conclusion. Therefore, at the end of the day, the argument “If the squatters settle here, then the cattlemen will be angry and that there will be a fight for water rights. The squatters are going to settle here. Therefore, there will be a fight for water rights” is absolutely valid.
Finally, let me give an example of an invalid argument so we can fully understand why the argument above is valid. Consider the example below.
2. If Marco had been a poor businessman, then he would have had to undertake extensive lecture hours. He did undertake extensive lecture hours. Hence, he must be a poor businessman. (p, q)
I need not explain again here why we have come up with the truth table above. The discussion above is enough for us to know how to construct a truth table.
Now, although not necessary, let’s remove the columns for the variables in the truth table above to avoid confusion. So, the truth table will now look like this:
If we recall, the rule in determining the validity of an argument in symbolic logic says that an argument is valid if it does not contain the form “all true premises and false conclusion” and an argument is invalid if “all of its premises are true and its conclusion false”. Please note that in applying the rule, we need to consider all rows in the truth table.
The easiest and most convenient way to do it is to look for an invalid form in each row, that is, a row that contains all true premises and a false conclusion. Thus, if we cannot find one, then the argument is obviously valid.
Now, if we look at the final truth table of the argument above, we can indeed find one row (row 3) that contains the form all true premises and a false conclusion. Thus, at the end of the day, the argument “If Marco had been a poor businessman, then he would have had to undertake extensive lecture hours. He did undertake extensive lecture hours. Hence, he must be a poor businessman. (p, q)” is absolutely invalid.
If either Algebra is required or Geometry is required, then all students will study mathematics. Algebra is required and trigonometry is required. Therefore, all students will study mathematics. (A, G, S, T)
Either Smith attended the meeting or Smith was not invited to the meeting. If the directors wanted Smith at the meeting, then Smith was invited to the meeting. Smith did not attend the meeting. If the directors did not want Smith at the meeting and Smith was not invited to the meeting, then Smith is on his way out of the company. Therefore, Smith was on his way out of the company. (A, I, D, W)
If a scarcity of commodities develops, then prices rise. If there is a change of administration, then fiscal controls will not be continued. If the threat of inflation persists, then fiscal controls will be continued. If there is overproduction, then prices do not rise. Either there is overproduction or there is a change of administration. Therefore, either scarcity of commodities does not develop or the threat of inflation does not persist. (S, P, C, F, I, O)
If the investigation continues, then new evidence is brought to light. If new evidence is brought to light, then several leading citizens are implicated. If several leading citizens are implicated, then newspapers stop publicizing the case. If continuation of the investigation implies that the newspapers stop publicizing the case, then the bringing to light of the new evidence implies that the investigation continues. The investigation does not continue. Therefore, new evidence is not brought to light. (C, N, I, S)
If the king does not castle and the pawn advances, then either the bishop is blocked or the rook is pinned. If the king does not castle, then if the bishop is blocked, then the game is a draw. Either the king castles or if the rook is pinned, then the exchange is lost. The king does not castle and the pawn advances. Therefore, either the game is a draw or the exchange is lost. (K, P, B, R, D, E)
If Andrews is present, then brown is present, and if Brown is present, then Cohen is not present. If Cohen is present, then Davis is not present. If Brown is present, then Emerson is present. If Davis is not present, then Farley is present. Either Emerson is not present or Farley is not present. Therefore, either Andrews is not present or Cohen is not present. (A, B, C, D, E, F)
Democracy can survive only if people can be taught to work for the public good rather than for their own self-interest. People can be taught to work for public good rather than for their own self-interest only if the theory of psychological egoism is false. Therefore, democracy can survive only if the theory of psychological egoism is false. (D, P, T)
If either George enrolls or Harry enrolls, then Ira does not enroll. Either Ira enrolls or Harry enrolls. If either Harry enrolls or George does not enroll, then Jim enrolls. George enrolls. Therefore, either Jim enrolls or Harry does not enroll. (G, H, I, J)
If Tom received the message, then Tom took the plane, but if Tom did not take the plane, then Tom missed the meeting. If Tom missed the meeting, then Dave was elected to the board, but if Dave was elected to the board, then Tom received the message. If either Tom did not miss the meeting or Tom did not receive the message, then either Tom did not take the plane or Dave was not elected to the board. Tom did not miss the meeting. Therefore, either Tom did not receive the message or Tom did not miss the meeting. (R, P, M, D)
If the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth, then the captain either had good motives for controlling the world or his motives were evil. The airship Albatros had powerful weapon only if its captain had more advanced scientific knowledge than his contemporaries; and if the captain had more advanced scientific knowledge than his contemporaries, then Albatros could destroy objects on the ground. It is either the case that if the Albatros could destroy objects on the ground its captain could enforce his will all over the earth, or it is the case that if he attempted to blow up the British vessel then his passengers would recognize the hoax. It is not the case that his attempt to Blow up the British vessel resulted in his passengers’ recognizing the hoax. Furthermore, the captain’s motives for controlling the world were not evil. Therefore, his motives were good. (A, D, W, G, E, S, B, P)
Dialectical materialism is true if and only if economic determinism is true. If dialectical materialism is true if and only if economic determinism is true, then both nature as a whole and economic conditions contain opposing forces. If nature as a whole and economic conditions contain opposing forces, these forces can be expressed as laws. Given that such forces can be expressed as laws, their formulation may be discovered by observing history. Their formulation may be discovered by observing history only if there is progress in history and enough time has elapsed for the pattern to be observable. Hence, Marx claimed, there is progress in history and enough time has elapsed for the pattern to be evident. (D, E, N, C, L, F, P, T)
If Prof. Sparks is right, then this is the best of all possible worlds. Of course, this is the best of all possible worlds only if the evils it contains are necessary evils. If the evils it contains are necessary evils, this implies the truth of the Principle of Sufficient Reason ⎯ i.e., there is good reason for everything being as it is and not otherwise. If there is good reason for everything being as it is and not otherwise, then there must be good reason for Louie having been kicked out by the baron and for the earthquake having destroyed Lisbon. And if either Louie had not been involved in the Inquisition or had not desired lady Cunnie, then either he would not have wandered over America on foot or he would not have lost the sheep from Eldorado. If he had not wandered over America on foot or had not lost the sheep from Eldorado, then some principle other than the Principle of Sufficient Reason would be required to explain what happens in this world. And no principle other than the Principle of Sufficient Reason is required to explain what happens in this world. If it were not true that either Louie had not been involved in the Inquisition or that he had not desired lady Cunnie, then it would be true that Prof. Sparks is right. Therefore, there must be a good reason for Louie having been kicked out by the baron and for the earthquake having destroyed Lisbon. (P, B, E, R, C, L, I, D, W, S, O)
In these notes, I will be discussing the topic “symbolizing statements in propositional (or symbolic) logic.” This is very important because, as I have already said in my earlier post before we can determine the validity of an argument in symbolic logic by applying a specific rule, we need to symbolize the argument first. So, how do we symbolize propositions in symbolic logic?
First, we need to identify the major connective. This is because once we have identified the major connective, we will be able to punctuate the proposition properly.
Second, we have to keep in mind that the variables or constants, such p and q or Y and Z, stand for the entire proposition, and not for the words within the proposition itself.
Third and last, we need to put proper punctuation and negation if necessary.
Let us consider the examples below.
If the squatters settle here, then the cattlemen will be angry and there will be a fight for water rights. (p, q, r)
As we can see, this example is a combination of a conditional proposition and a conjunctive proposition. However, if we analyze the proposition, it becomes clear to us that it is a conditional proposition whose consequent is a conjunctive proposition. Thus, the major connective in this proposition is “then.” Hence, when we symbolize the proposition, we need to punctuate the consequent. So, if we let p stand for “The squatters settle here,” q for “The cattlemen will be angry,” and r for “There will be a fight for water rights,” then the proposition is symbolized as follows:
p⊃ (q • r)
If either the butler or the maid is telling the truth, then the job was an inside one; however, if the lie detector is accurate, then both the butler and the maid are telling the truth. (p, q, r, s)
This example is indeed a complicated one. But it can be easily symbolized.
If we analyze the proposition, it becomes clear that it is a conjunctive proposition whose conjuncts are both conditional propositions with a component inclusive disjunction and conjunction respectively.
Now, if we let
p stands for “The butler is telling the truth” q for “The maid is telling the truth” r for “The job was an inside one” and s for “The lie detector is accurate”
then we initially come up with the following symbol: p v q ⊃ r • s ⊃ p • q
The symbol above, however, is not yet complete. In fact, it remains very complicated. So, we have to punctuate it.
Since the major connective of the proposition is “however,” then we have to punctuate the component conjuncts. Thus, we initially come up with the following symbol:
[p v q ⊃ r] •[s ⊃ p • q]
However, the symbolized form of the proposition remains complicated because the component conjuncts have not been properly punctuated. As already said, there should only be one major connective in a proposition. So, let us punctuate the first conjunct.
Since it is stated in the first conjunct that the proposition is a conditional proposition whose antecedent is an inclusive disjunction, then we have to punctuate p v q. Thus, we initially come up with the following symbol:
[(p v q) ⊃ r] •[s ⊃ p • q]
And then let us punctuate the second conjunct. Since it is stated in the second conjunct that the proposition is a conditional proposition whose consequent is a conjunctive proposition, then we have to punctuate p • q. Thus, we come up with the following symbol:
[(p v q) ⊃ r] •[s ⊃ (p • q)]
Now, the symbol appears to be complete. Thus, the final symbol of the proposition “If either the butler or the maid is telling the truth, then the job was an inside one; however, if the lie detector is accurate, then both the butler and the maid are telling the truth” is as follows:
[(p v q) ⊃ r] •[s ⊃ (p • q)]
Neither Lucas is hard-working nor is he intelligent. (p, q)
This example is obviously an inclusive disjunction; hence, we may initially symbolize the proposition as p v q. However, the words “Neither…nor” is a signifier of a negation, and these words suggest that the entire proposition is negated. Thus, we finally symbolize the proposition “Neither Lucas is hard-working nor is he intelligent” as follows:
~ (p v q)
Please note that ~ (p v q) is not the same with ~p v ~ q. And ~p v ~ q is not the proper symbol of example #3 because the words “Neither…nor” suggest that the proposition has to be completely negated. As we learned in my previous post titled “Punctuating Propositions in Symbolic Logic” (see http://philonotes.com/index.php/2018/02/11/punctuating-propositions-in-symbolic-logic/), when the proposition is completely negated, then the entire proposition has to be punctuated.
But let me explain why ~ (p v q) is not the same with ~p v ~ q. If we recall, the rules in inclusive disjunction say “The inclusive disjunction is true if at least one of the disjuncts is true.” With this, let us determine the truth value of ~ (p v q) and ~p v ~ q in order to prove that they are not the same.
Let us assign the truth value “true” for p and “false” for q.
It is not the case that the manager will resign if she does not receive a salary increase. (p, q)
Please note that since the negation sign “It is not the case” precedes the entire proposition, then the entire proposition has to be negated. Thus, we need to punctuate the entire proposition and put the negation sign outside of it.
As I discussed in one of my previous posts, we learned that 1) the variables provided after the proposition represent the propositions in the entire proposition respectively, and 2) since in the example above the antecedent is written after the consequent, then q must be our antecedent and p our consequent. Hence, we initially come up with the following symbol: ~q ⊃ p. Please note that q is negated because it is clearly specified in the proposition. In other words, the proposition contains a negation sign “not.”
Now, since the negation sign “It is not the case” precedes the entire proposition, then, again, the entire proposition must be negated. Thus, we finally symbolize the proposition “It is not the case that the manager will resign if she does not receive a salary increase” as follows:
~ (~q ⊃ p)
If it is not the case that the professor will take a leave of absence if and only if the administration allows him to, then there must be another good reason why the professor will take a leave of absence. (p, q, r)
In this example, since the negation sign “It is not the case” does not precede the entire proposition, then we do not negate the entire proposition. We only negate the proposition where the negation sign immediately precedes. Thus, the negation sign in the example above only negates the proposition “The professor will take a leave of absence if and only if the administration allows him to.” It does not clearly negate the proposition “There must be another good reason why the professor will take a leave of absence.”
Now, if we analyze the proposition, we notice that:
p stand for “The professor will take a leave of absence” q for “The administration allows him to” and r for “There must be another good reason why the professor will take a leave of absence.”
Please note that we do not repeat the variable “p” for the proposition “There must be another good reason why the professor will take a leave of absence” because the thought of the proposition is completely changed. This is because of the addition of the idea “There must be another good reason.” Thus, instead of repeating the variable “p,” we use the variable “r” to represent the proposition “There must be another good reason why the professor will take a leave of absence.”
So, we symbolize the proposition “If it is not the case that the professor will take a leave of absence if and only if the administration allows him to, then there must be another good reason why the professor will take a leave of absence” as follows:
In these notes, I will discuss how to symbolize arguments in propositional or symbolic logic, which uses all the basic symbols, especially the use of parentheses. As I have mentioned in my other notes, symbolizing arguments in logic is important because before we can determine the validity of an argument in symbolic logic, we need to symbolize the argument first.
In symbolizing arguments in symbolic logic, we need to do the following:
First, we need to symbolize the argument sentence by sentence.
Second, we have to identify the major connectives in each sentence of the argument. This is important because once we have identified the major connective we will be able to punctuate the sentence or proposition properly.
Third, we need to remember that the variables or constants, such p and q or Y and Z, stand for the entire sentence or proposition, and not for the words within the sentence or proposition itself.
Lastly, we need to put proper punctuations and negation signs if necessary.
Let us consider the example below.
If the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth, then the captain either had good motives for controlling the world or his motives were evil. The airship Albatros had a powerful weapon if and only if its captain had more advanced scientific knowledge than his contemporaries; and if the captain had more advanced scientific knowledge than his contemporaries, then Albatros could destroy objects on the ground. It is either the case that if the Albatros could destroy objects on the ground its captain could enforce his will all over the earth, or it is the case that if he attempted to blow up the British vessel then his passengers would recognize the hoax. It is not the case that his attempt to Blow up the British vessel resulted in his passengers’ recognizing the hoax. Furthermore, the captain’s motives for controlling the world were not evil. Therefore, his motives were good. (A, D, W, G, E, S, B, P)
As we can see, the argument above is quite long and indeed complicated. But again, we can easily symbolize this argument because, as I already mentioned, we will symbolize this argument sentence by sentence (or proposition by proposition). So, let’s start with the first sentence.
Sentence 1
If the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth, then the captain either had good motives for controlling the world or his motives were evil.
If we analyze this sentence, it is clear that the major connective is “if…then” or just “then”. Hence, it is a conditional proposition. Now, in symbolizing this sentence, we need to punctuate the antecedent and the consequent.
If we look at the antecedent, we notice that it is a compound proposition whose conjuncts are both conditional propositions. Because there are several connectives in the sentence, then we also need to punctuate the antecedent. Hence, the antecedent (which reads: the fact that the airship Albatros had powerful weapon meant it could destroy objects on the ground, and its capability of destroying objects on the ground meant that the captain could enforce his will all over the earth) is symbolized as follows:
(A ⊃ D) • (D ⊃ W)
As we can see, the consequent of the proposition above is an exclusive disjunction. Thus, we need to underscore the wedge to differentiate it from an inclusive disjunction. The consequent (which reads: the captain either had good motives for controlling the world or his motives were evil) is symbolized as follows: G v E.
Please note that the constants provided at the end of the argument above represent the propositions in the entire argument respectively. Thus, in the first proposition, the constant A stands for “the airship Albatros had powerful weapon”, D stands for “it could destroy objects on the ground”, W stands for “the captain could enforce his will all over the earth”, G stands for “the captain either had good motives for controlling the world”, and E stands for “his motives were evil”.
Now, when we symbolize the entire proposition, we need to punctuate both the antecedent and the consequent because, as the rule says, there should only be one major connective in each proposition. Thus, the proposition above is symbolized as follows:
[(A ⊃ D) • (D ⊃ W)] ⊃ (G v E)
Note: Please apply the principles discussed above in symbolizing the rest of the sentences below. If you have questions or clarifications, please leave a comment below. The PHILO-notes team is happy to respond to them.
Sentence 2
The airship Albatros had powerful weapon if and only if its captain had more advanced scientific knowledge than his contemporaries; and if the captain had more advanced scientific knowledge than his contemporaries, then Albatros could destroy objects on the ground.
(A ≡ S) • (S ⊃ D)
Sentence 3
It is either the case that if the Albatros could destroy objects on the ground its captain could enforce his will all over the earth, or it is the case that if he attempted to blow up the British vessel then his passengers would recognize the hoax.
(D ⊃ W) v (B ⊃ P)
Sentence 4
It is not the case that his attempt to Blow up the British vessel resulted in his passengers’ recognizing the hoax.
~ (B ⊃ P)
Sentence 5
Furthermore, the captain’s motives for controlling the world were not evil.
~ E
Sentence 6 (which is the conclusion)
Therefore, his motives were good.
G
In the end, the argument above is symbolized as follows:
In these notes, I will briefly discuss the topic “punctuating statements in propositional (or symbolic) logic.”
But why do we need to punctuate propositions in symbolic logic? This is because, in many instances, propositions in symbolic contain more than one connective; but in symbolic logic, all propositions should only have one major connective.
Thus, if there are two or more connectives, then we have to punctuate the proposition accordingly so that the major connective will become clear.
Symbolic logic uses parentheses ( ), brackets [ ], and braces { } as punctuation symbols.
Let us consider the example below.
If the road is wet, theneither it rains today or the fire truck spills water on the road. (p, q, r)
As we can see, the example contains three propositions, namely:
1) The road is wet,
2) It rains today, and
3) The fire truck spills water on the road.
And as I already discussed in my previous posts, we learned that the variables provided after the proposition represent the propositions in the entire proposition respectively. Thus, in the example above, p stands for “The road is wet,” q for “It rains today,” and r for “The fire truck spills water on the road.” Hence, initially, the proposition is symbolized as follows:
p ⊃ q v r
However, the symbol above is not yet complete because, at this point, it is not yet clear what type of proposition it is. This is the reason why we need to punctuate the proposition. Please see my previous discussion on “Propositions and Symbols Used in Symbolic Logic” (see http://philonotes.com/index.php/2018/02/02/symbolic-logic/) for some idea on how to symbolize a proposition in symbolic logic.
Now, if we analyze the proposition, it would become clear that it is a conditional proposition whose consequent is an inclusive disjunction. For this reason, we need to punctuate the consequent.
Thus, the proposition “If the road is wet, theneither it rains today or the fire truck spills water on the road” is symbolized as follows:
p ⊃ (q v r)
I will discuss more about this when I go to the discussion on “symbolizing propositions” in symbolic logic.
Meantime, let me give examples of a punctuated proposition just to show that statements in propositional or symbolic logic that contain two or more connectives have to be punctuated accordingly. Please see examples below then.
In my other notes titled “Propositions and Symbols Used in Propositional (or Symbolic) Logic” (see http://philonotes.com/index.php/2018/02/02/symbolic-logic/), I discussed the two basic types of a proposition as well as the symbols used in symbolic logic. I have also briefly discussed how propositions can be symbolized using a variable or a constant.
In these notes, I will discuss the topic “negation of statements in propositional (or symbolic) logic” or the way in which propositions or statements in symbolic logic are negated.
To begin with, we have to note that any statement used in symbolic logic can be negated. And as I have already mentioned in the previous discussion, symbolic logic uses ~ (tilde) to symbolize a negative proposition.
But how do we know that the statement is negative?
A statement is negative if it contains at least one of the following signifiers:
No
Not
It is false
It is not the case
It is not true
For example, let us consider the following statements:
Either no students are interested in the party or it is not the case that the
administration requires the students to attend the party.
If the company does not increase the salary of the workers, then the union will go on strike to press its various demands.
The professor will not be absent if and only if he is not sick.
As we notice, example #1 is a compound statement, and both component statements contain the negation signs “no” and “it is not the case.” For this reason, when we symbolize the entire statement, then both component statements should be negated. Hence, if we let p stand for “No students are interested in the party” and q for “It is not the case that the administration requires the students to attend the party,” then the statement “Either no students are interested in the party or it is not the case that the administration requires the students to attend the party” can be symbolized as follows:
~ pv~ q
In example #2, only the first component statement contains the negation sign “not.” Hence, only the first statement should be negated. Thus, if we let p stand for “The company does not increase the salary of the workers” and q for “The union will go on strike to press its various demands,” then the statement “If the company does not increase the salary of the workers, then the union will go on strike to press its various demands,” is symbolized as follows:
~ p ⊃ q
In example #3, both component statements contain a negation sign “not.” Thus, when symbolized, both component statements have to be negated. Hence, if we let p stand for “The professor will not be absent” and q for “He is not sick,” then the statement “The professor will not be absent if and only if he is not sick” is symbolized as follows:
~ p ≡ ~ q
Now, sometimes a statement can be double (or even triple) negated. In other words, the statement contains two or more negation signs. If this happens, then the statement has to be symbolized accordingly. Consider this example: “It is not true that the professor is not sick.” If we let p stand for the entire statement, then it is symbolized as follows:
~~ p
However, since a double negation implies affirmation, then the statement can also be symbolized as follows:
p
In some cases, contradictory words, such as “kind and unkind” and “mortal and immortal,” may signify negation if and only if it is clearly specified in the statement; otherwise, the statement should not be negated. Consider the following examples:
Lulu is generous, while Lili is unkind.
Either George is kind or Bert is unkind.
In example #1, the word “unkind” does not clearly signify negation. Thus, the statement “Lili is unkind” is not a negative statement. Let us symbolize example #1. If we let p stand for “Lulu is generous” and q for “Lili is unkind,” then the proposition “Lulu is generous, while Lili is unkind” is symbolized as follows:
p • q
However, the word “unkind” in example #2 above clearly signifies negation because of the presence of the contradictory words “kind and unkind” in the statement. Now, if we let p stand for “George is kind” and q for “Bert is unkind,” then the statement “Either George is kind or Bert is unkind” is symbolized as follows:
p v~q
This is because the statement “Either George is kind or Bert is unkind” can also be stated in this manner: “Either George is kind or Bert is not kind.”
Rule in Negation
The negation of a true statement is false; while the negation of a false statement is true.
Obviously, the rule in negation says that if a particular statement is true, then it becomes false when negated. And if a particular statement is false, then it becomes true when negated. The truth table below illustrates this point.
Let us determine the truth-value of a negative statement by applying the rule in negation.
Consider the example below.
It is not the case that the administration requires the students to attend the party.
Again, if we let p stand for the statement “The administration requires the students to attend the party,” then the statement is symbolized as p. However, since the statement contains a negation sign “It is not the case,” then the statement is negative. Thus, the statement has to be symbolized as follows:
~ p
Now, if we assume that the statement “The administration requires the students to attend the party” is true, that is, the administration did indeed require the students to attend the party, then the statement “It is not the case that the administration requires the students to attend the party” is absolute false. To illustrate:
Please note that when we assign a truth-value to a statement, we assign it to the statement without the negation sign. Thus, if we have the statement ~ p, and if we assign, for example, True value to the statement, we assign it to p and not to ~ p.
