Problem 27
Question
Translate each argument into symbolic form. Then determine whether the argument is valid or invalid. You may use a truth table or, if applicable, compare the argument's symbolic form to a standard valid or invalid form. (You can ignore differences in past, present, and future tense.) If I'm tired, I'm edgy. If I'm edgy, I'm nasty. \(\therefore\) If I'm tired, I'm nasty.
Step-by-Step Solution
Verified Answer
The logical argument 'If I'm tired, I'm nasty' is valid as it follows the transitive rule of logical implication, derived from the arguments 'If I'm tired, I'm edgy' and 'If I'm edgy, I'm nasty'.
1Step 1: Assign symbols
Let's denote 'I'm tired', 'I'm edgy' and 'I'm nasty' as p, q and r respectively.
2Step 2: Convert into Symbolic form
The argument now can be written as: If p, then q. If q, then r. Therefore, if p, then r.
3Step 3: Use Logical Implication Rule
The rule for logical implications is that if 'p implies q' and 'q implies r', then 'p implies r'. This is also known as the Transitive Rule in Logic.
4Step 4: Check the Argument's Validity
Comparing our symbolic form with the standard form of a logical implication, we can conclude that the argument 'If p, then r' or 'If I’m tired, I’m nasty' is a valid logical deduction from the premises 'If p, then q' and 'If q, then r' or 'If I'm tired, I'm edgy' and 'If I'm edgy, I'm nasty'.
Key Concepts
Symbolic LogicLogical ImplicationTransitive RuleValidity of Arguments
Symbolic Logic
Symbolic logic is an essential branch of logic that uses symbols to represent logical expressions. It provides a way to simplify and unequivocally express logical arguments, avoiding ambiguity.
To translate common language statements into symbolic logic, we assign different symbols, usually letters like \( p, q, \) or \( r \), to represent specific assertions or propositions.
This abstraction allows us to focus purely on the structure of the argument without being bogged down by the actual content, enabling clearer analysis.
To translate common language statements into symbolic logic, we assign different symbols, usually letters like \( p, q, \) or \( r \), to represent specific assertions or propositions.
- p: I'm tired
- q: I'm edgy
- r: I'm nasty
This abstraction allows us to focus purely on the structure of the argument without being bogged down by the actual content, enabling clearer analysis.
Logical Implication
Logical implication is a fundamental concept in logical reasoning. It describes a relationship between two propositions where the truth of one proposition (the antecedent) guarantees the truth of the other (the consequent).
In simple terms, \( p \rightarrow q \) expresses that "if \( p \) is true, then \( q \) must also be true."
Understanding logical implications helps us see how different statements connect and lead to conclusions based on given premises.
In simple terms, \( p \rightarrow q \) expresses that "if \( p \) is true, then \( q \) must also be true."
- Here, \( p \rightarrow q \) stands for "If I'm tired, I'm edgy."
- Similarly, \( q \rightarrow r \) stands for "If I'm edgy, I'm nasty."
Understanding logical implications helps us see how different statements connect and lead to conclusions based on given premises.
Transitive Rule
The transitive rule is an invaluable tool in logical reasoning, especially in deducing conclusions from sequential implications.
This rule states that if "\( p \rightarrow q \)" and "\( q \rightarrow r \)", then "\( p \rightarrow r \)" necessarily follows.
It's like saying if a train goes from Station A to Station B, and Station B to Station C, it can inherently go from Station A directly to Station C.
This rule states that if "\( p \rightarrow q \)" and "\( q \rightarrow r \)", then "\( p \rightarrow r \)" necessarily follows.
It's like saying if a train goes from Station A to Station B, and Station B to Station C, it can inherently go from Station A directly to Station C.
- Applying this rule to our exercise: "If I'm tired, I'm edgy" (\( p \rightarrow q \)), and "If I'm edgy, I'm nasty" (\( q \rightarrow r \)), leads to "If I'm tired, I'm nasty" (\( p \rightarrow r \)).
Validity of Arguments
The validity of an argument in logic refers to whether the conclusion logically follows from the premises. An argument is considered valid if, assuming the premises are true, the conclusion cannot be false.
In symbolic logic, like the argument we translated, validity doesn't concern the actual truth of the premises but focuses on the relationship between statements.
In symbolic logic, like the argument we translated, validity doesn't concern the actual truth of the premises but focuses on the relationship between statements.
- "If \( p \rightarrow q \)" and "\( q \rightarrow r \)" made the extension "\( p \rightarrow r \)" valid.
- The same structure can be seen as a standard known valid form, often expressed in logical exercises.
Other exercises in this chapter
Problem 26
Let \(p\) and \(q\) represent the following simple statements: \(p: Y o u\) are human. q: You have feathers. Write each compound statement in symbolic form. You
View solution Problem 26
According to Condensed Knowledge: A Deliciously Irreverent Guide to Feeling Smart Again (Harper Collins, 2004), each statement listed below is false. \(p\) : Li
View solution Problem 27
Write the negation of each statement. I'm going to Seattle or San Francisco.
View solution Problem 27
Write the converse, inverse, and contrapositive of each statement. If all institutions place profit above human need, then some people suffer.
View solution