Problem 39 - Thinking Mathematically

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 you tell me what I already understand, you do not enlarge my understanding. If you tell me something that I do not understand, then your remarks are unintelligible to me. \(\therefore\) Whatever you tell me does not enlarge my understanding or is unintelligible to me.

Step-by-Step Solution

Answer

To determine the validity of the argument, either construct a truth table or draw out the logical implications from the premises to the conclusion. The approach to use depends on personal preference and familiarity with the methods.

Step 1: Define the Statements

First, assign symbolic letters to the statements in the argument. Let's define the statements as follows: \n \(A\): 'You tell me what I already understand.' \n \(B\): 'You do not enlarge my understanding.' \n \(C\): 'You tell me something that I do not understand.' \n \(D\): 'Your remarks are unintelligible to me.' \n \(E\): 'Whatever you tell me does not enlarge my understanding or is unintelligible to me.'

Step 2: Convert into Symbolic Form

The first statement can be symbolically expressed as \(A → B\). \n The second statement can be expressed as \(C → D\). \n The conclusion can be written as \(A ∨ C → B ∨ D\)

Step 3: Construct a Truth Table

To evaluate the validity of the argument, construct a truth table for all statements and observe whether the conclusion precisely follows the premises. If it does, the argument is valid, if not, it's invalid.

Step 4: Compare Symbolic Form to Standard Valid or Invalid Form

Here instead of constructing a truth table, you can try to derive the formula \(A ∨ C → B ∨ D\) from \(A → B\) and \(C → D\). If it's possible, the conclusion is valid.

Key Concepts

Truth Table

In symbolic logic, a truth table is a useful tool that displays all possible truth values of logical expressions. This method helps us determine the validity of an argument by examining each potential scenario to see if the premises lead logically to the conclusion. Let's consider evaluating an argument with a truth table:

• List all the variables involved in the argument. In our example, these are statements \(A\), \(B\), \(C\), \(D\), and \(E\).
• Create columns for each premise and conclusion, then list every possible combination of true (T) and false (F) for these statements.
• Analyze whether the conclusion is true whenever the premises are true. If for every possible combination of true premises, the conclusion is also true, the argument is valid.

Truth tables simplify complex logical expressions by breaking them down into digestible components. They provide a clear path to understanding how individual logical statements interact.

Argument Validity

The validity of an argument in symbolic logic is determined by whether the conclusion logically follows from its premises. Here's how we assess argument validity:

• If the conclusion holds true in every case where the premises are true, the argument is considered valid.
• Conversely, if there is even one instance where the premises are true and the conclusion is false, the argument is deemed invalid.

To ensure validity, we can use truth tables or compare the symbolic form to standard valid argument forms like modus ponens, modus tollens, or hypothetical syllogism. These approaches provide a structured way to test if the logical flow from premises to conclusion is sound. In argument analysis, validity ensures that the reasoning is solid, while also guiding us when to reject arguments as unsound.

Logical Reasoning

Logical reasoning is the foundation of forming valid arguments and solving logical problems. It involves analyzing the relationships between statements to see how conclusions can be derived.

• Logical reasoning applies rules of logic to connect truth values of premises to conclusions.
• It helps us avoid errors in thinking by using clear, consistent steps to solve problems or evaluate arguments.
• In our example, logical reasoning enables us to determine if the conclusion that 'whatever you tell me does not enlarge my understanding or is unintelligible to me' naturally follows from the provided premises. By establishing the relationships \(A \to B\) and \(C \to D\), we can piece together the more complex statement \(A \lor C \to B \lor D\).

Effective logical reasoning demands understanding how individual statements relate and building logically cohesive chains that reinforce sound conclusions.

Symbolic Form

Symbolic form translates complex verbal statements into logical expressions using symbols. This translation is crucial because it allows us to apply mathematical rigor to assess argument validity.

• Statements like 'If you tell me what I already understand, you do not enlarge my understanding' are rewritten using symbols, forming concise expressions such as \(A \to B\) or \(C \to D\).
• Using symbols like \(\land\), \(\lor\), and \(\to\) represent logical operations like 'and', 'or', and 'implies'. This helps in forming logical equations that can be further analyzed or simplified using truth tables or logical equivalences.
• By converting natural language into symbolic form, we enable easier manipulation of arguments, allowing us to delve deeper into understanding intricate logical relationships.

Turning arguments into symbolic form makes them more accessible, allowing us to engage with statements in a structured logic-based framework.