Topic 1: Logic Fundamentals

Which logical connective is used to represent "if...then" in propositional logic?

• Conjunction

• Disjunction

• Implication

• Biconditional

Answer explanation

In propositional logic, the logical connective used to represent 'if...then' statements is called implication. The question asks which logical connective represents 'if...then' statements. The correct choice is 'Implication'. The answer explanation is generated based on the query, options, and answer provided.

What is the truth value of the following compound proposition when P is true and Q is false? ¬(P ∧ Q)

• True

• False

• Cannot be determined

• None of the above

Answer explanation

The given question asks about the truth value of the compound proposition ¬(P ∧ Q), where P is true and Q is false. The negation of the conjunction of P and Q, in this case, becomes true. Therefore, the correct answer is True. This explanation clarifies the correct choice without mentioning the option number and does not explicitly state the question as a query, but rather as a question.

If the proposition P is false and the proposition Q is true, what is the truth value of the compound proposition (¬P ∧ Q) ∨ (P → Q)?

• True

• False

• Cannot be determined

• None of the above

Answer explanation

The truth value of the compound proposition (¬P ∧ Q) ∨ (P → Q) can be determined by evaluating its components. Since P is false and Q is true, (¬P ∧ Q) evaluates to false and (P → Q) evaluates to true. The logical OR operation between false and true results in true. Therefore, the truth value of the compound proposition is True.

In a biconditional proposition (P ↔ Q), which of the following statements is true?

• Both P and Q must be true or both must be false for the proposition to be true.

• Either P or Q must be true, but not both, for the proposition to be true.

• P and Q must have different truth values for the proposition to be true.

• The proposition is always true, regardless of the truth values of P and Q.

Answer explanation

In a biconditional proposition, both P and Q must be true or both must be false for the proposition to be true. This means that if P is true, then Q must also be true, and if P is false, then Q must also be false. The biconditional proposition is not true if P and Q have different truth values. Therefore, the correct statement is that both P and Q must have the same truth value for the proposition to be true.

Which of the following is the contrapositive of the proposition P → Q?

• ¬P → ¬Q

• ¬Q → ¬P

• Q → P

• P ∧ ¬Q

Answer explanation

In logic, the contrapositive of a conditional statement P → Q is ¬Q → ¬P. So, when the question asks for the contrapositive of the proposition P → Q, the correct option is ¬Q → ¬P. The other options do not correctly represent the contrapositive.

Which of the following is the converse of the proposition P → Q?

• ¬P → ¬Q

• Q → P

• ¬Q → ¬P

• P ∧ ¬Q

Answer explanation

The converse of the proposition P → Q is Q → P. In this case, the correct choice is

Q → P

as it reverses the order of P and Q. The converse statement states that if Q is true, then P must also be true. The other options do not represent the converse relationship between P and Q.

• True

• False

Answer explanation

The given statement

p ∨ ¬p

is a tautology, which means that it is always true regardless of the truth values of p. In other words, no matter what value we assign to p (true or false), the compound statement will always evaluate to true. This holds true for all logical statements that involve a logical OR operation between a statement and its negation. Therefore, the correct answer is 'True'.

Which of the following compound propositions is a contradiction?

• P ∨ Q

• P ∧ ¬P

• P → Q

• P ↔ Q

Answer explanation

The question asks which of the given compound propositions is a contradiction. The correct choice is 'P ∧ ¬P' which represents the logical conjunction of a proposition with its negation. This combination always evaluates to false, making it a contradiction. The other options do not represent contradictions. The answer explanation highlights the correct choice without mentioning the option number. The question is about a compound proposition, not just a query.

Answer explanation

The given question asks to identify the logical equivalence for the expression ¬(p∧q). The correct answer is ¬p∨¬q, which means 'not p or not q'. To explain this, we can say that the expression ¬p∨¬q represents 'not p or not q', which is equivalent to 'not (p and q)'. Thus, ¬p∨¬q is the correct choice as it logically matches ¬(p∧q). Therefore, the answer is ¬p∨¬q.

• Identity Law

• Domination Law

• Negation Law

• Idempotent Law

Answer explanation

The question asks to identify the law that satisfies the given logical expression

p ∨ T ≡ T

. The correct choice is the Domination Law, which states that any logical statement combined with a tautology will result in a tautology. Therefore, the correct answer is the Domination Law.