Problem 37 - Thinking Mathematically

Question

Use a truth table to determine whether each statement is a tautology, a self- contradiction, or neither. \([(p \vee q) \wedge p] \rightarrow \sim q\)

Step-by-Step Solution

Answer

Upon creating a truth table and evaluating the proposition, it will be found that the proposition is neither a tautology nor a self-contradiction. The truth table contains both T's and F's in the column of truth values for the whole proposition.

Step 1: Create the truth table

Create a truth table with columns for each variable (p and q), each operation in the proposition, and the whole proposition. For two variables (p and q), there are 4 possible combinations of truth values: TT, TF, FT, FF, where T represents 'true' and F represents 'false'.

Step 2: Determine truth values for each operation and the whole proposition

Calculate the truth values of each operation and the whole proposition for each combination of truth values of variables. First evaluate operations inside brackets. For the given proposition, \((p \vee q) \wedge p\), determine the truth values based on the truth values of p and q. Then, use these values to evaluate the truth value of the whole proposition, \([(p \vee q) \wedge p] \rightarrow \sim q\)

Step 3: Analyze the truth table to deduce the type of the proposition

Look at the column of truth values for the whole proposition. If it is all T's, the proposition is a tautology. If it is all F's, the proposition is a self-contradiction. If it contains both T's and F's, it is neither.

Key Concepts

Logical Statements

Logical statements, also known as propositions, are the basic building blocks of logic. They express ideas or assertions that can either be true or false. In logic, we use these statements to reason about the world around us.

Understanding logical statements is crucial, as they form the foundation for more complex logical constructs. For instance, a statement such as "It is raining" might be true or false, depending on the weather. This binary true/false nature is essential for logical analysis.

Logical statements can be combined using operators like AND (\(\wedge\)), OR (\(\vee\)), and NOT (\(\sim\)). This allows us to create compound statements, which can represent more complex scenarios. These compound statements are then analyzed through truth tables, enabling us to determine their truth values under different conditions.

Tautology

A tautology in logic refers to a statement or proposition that is always true, no matter the truth values of its individual components. This means that a tautology will produce a truth value of 'true' in every possible scenario when evaluated in a truth table.

An example of a tautology is the statement "It is raining OR it is not raining." In every possible reality, one of these conditions is always met, reflecting its more symbolic form: \( p \vee \sim p \). Even if it's pouring outside or the sun is shining, this statement remains true.

Tautologies are important because they reveal invariability in logical frameworks. When analyzing logical constructs, identifying tautologies helps to understand which statements are universally or necessarily true, assisting in simplifying logical expressions and proofs.

Self-Contradiction

Self-contradiction refers to a logical statement that is false in every possible scenario. Essentially, these are statements that cannot possibly be true, no matter the condition tested.

An example of a self-contradiction is the proposition "It is raining AND it is not raining." Such a situation is logically impossible – both conditions cannot be true simultaneously. The formal representation of this would be \( p \wedge \sim p \).

In logic, identifying self-contradictions is useful because they point out inconsistencies or errors in reasoning. Ensuring that a logical construct is not self-contradictory is a fundamental step in validating the soundness of arguments and proofs. When using truth tables, such statements will show all false values across the board, indicating an inherent logical flaw.