Chapter 1.2 discrete math

What are De Morgan's Laws related to negating compound statements?

De Morgan's Laws provide rules for negating compound statements involving 'AND' (conjunction) and 'OR' (disjunction). These laws are:$\neg(p \land q) \equiv (\neg p) \lor (\neg q)$ (Negation of AND: 'Not both p and q' is logically equivalent to 'Not p or not q', meaning at least one of them is false.) AND $\neg(p \lor q) \equiv (\neg p) \land (\neg q)$ (Negation of OR: 'Not p or q' is logically equivalent to 'Not p and not q', meaning neither p nor q is true.)

What does the negation of AND ($\neg(p \land q)$) indicate?

The negation of AND, $\neg(p \land q)$, indicates that it is 'Not the case that both p and q are true.' This is logically equivalent to saying that 'Either p is false, or q is false, or both are false.' In simpler terms, 'At least one of the statements is not true.'

What does the negation of OR ($\neg(p \lor q)$) indicate?

The negation of OR, $\neg(p \lor q)$, indicates that it is 'Not the case that p is true or q is true.' This is logically equivalent to saying that 'Both p is false AND q is false.' In simpler terms, 'Neither p nor q is true.'

What is a Tautology?

A Tautology is a type of logical statement that is always true, no matter what the truth values of its individual component statements are. It represents a fundamental truth in logic. An example is $p \lor \neg p$ (p or not p), which is always true because p must be either true or false.

What is a Contradiction?

A Contradiction is a type of logical statement that is always false, regardless of the truth values of its individual component statements. It represents a logical impossibility. An example is $p \land \neg p$ (p and not p), which is always false because p cannot be both true and false simultaneously.

What is the logical equivalence of a proposition $p$ and a Tautology ($t$)?

The logical equivalence of a proposition $p$ and a Tautology ($t$) when combined with AND is: $p \land t \equiv p$. This means that 'p AND a true statement' is logically equivalent to just 'p' because the Tautology ($t$) does not constrain $p$; if $p$ is true, the compound statement is true, and if $p$ is false, the compound statement is false.

What is the logical equivalence of a proposition $p$ and a Contradiction ($c$)?

The logical equivalence of a proposition $p$ and a Contradiction ($c$) when combined with AND is: $p \land c \equiv c$. This means that 'p AND a false statement' is logically equivalent to just 'c' (a contradiction) because no matter what the truth value of $p$ is, the conjunction with a false statement will always result in a false statement.

What is a Conditional Statement and how is it expressed?

A Conditional Statement, often called an 'implication,' asserts that if one statement (the antecedent, $p$) is true, then another statement (the consequent, $q$) must also be true. It is commonly expressed as $p \rightarrow q$ ('if p, then q'). The only scenario in which a conditional statement is false is when $p$ is true and $q$ is false.

What is the key logical equivalence of a Conditional Statement ($p \rightarrow q$)?

The key logical equivalence of a Conditional Statement ($p \rightarrow q$) is: $\neg p \lor q$. This means 'if p, then q' is logically equivalent to 'not p OR q'. This equivalence is crucial because it allows conditional statements to be rewritten in terms of disjunctions and negations, simplifying logical analysis or proofs. Essentially, the conditional holds true if $p$ is false (making the 'if' condition not met) or if $q$ is true (fulfilling the 'then' outcome).

What is a Contrapositive?

The Contrapositive of a conditional statement $p \rightarrow q$ ('if p, then q') is the statement formed by negating both the consequent and the antecedent and then swapping their positions: $\neg q \rightarrow \neg p$ ('if not q, then not p'). A critical property of the contrapositive is that it is logically equivalent to the original conditional statement, meaning they always have the same truth value. This makes the contrapositive a valuable tool in proofs and logical reasoning.

What does logical equivalence ($\equiv$) indicate between two statements?

Logical equivalence ($\equiv$) indicates that two statements always have the exact same truth values in all possible scenarios or interpretations. This means that they can be used interchangeably in any logical argument without affecting the validity of that argument. When two statements are logically equivalent, they convey the same logical meaning, even if their structure or wording differs.

What is an 'Area of Application' in logical principles?

An 'Area of Application' in logical principles refers to the real-world field, domain, or context where a specific logical principle, rule, or statement can be practically applied to model, analyze, or solve problems. Examples include:

• Computer Science: Designing algorithms, verifying software, database queries.
• Mathematics: Proving theorems, set theory.
• Philosophy/Critical Thinking: Analyzing arguments, identifying fallacies.
• Law: Interpreting statutes, constructing legal arguments.
• Everyday Reasoning: Making decisions, understanding cause and effect.