Chapter 1 Flashcards

1
Q
  1. Which of the following is a proposition?
    a) What time is it?
    b) The sky is blue.
    c) Open the door.
    d) x + 2 = 5
A

b) The sky is blue.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  1. What is the truth value of the proposition P∧Q, if P=True and Q=False?
    a) True
    b) False
    c) Depends on the context
    d) Undefined
A

b) False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  1. Translate the statement “If it rains, then the ground will be wet” into propositional logic.
    a) P∧Q
    b) P∨Q
    c) P→Q
    d) ¬P∧Q
A

c) P→Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  1. Which of the following statements is a tautology?
    a) P∨¬P
    b) P∧Q
    c) P∧¬P
    d) ¬P
A

a) P∨¬P

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q
  1. Which of the following is NOT a tautological equivalence?
    a) ¬(P∨Q)≡(¬P∧¬Q)
    b) ¬(P∧Q)≡(¬P∨¬Q)
    c) P∧Q≡P∨Q
    d) (P→Q)≡(¬P∨Q)
A

c) P∧Q≡P∨Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
  1. Which of the following is a valid use of De Morgan’s Laws?
    a) ¬(P ∧ Q) ≡ ¬P ∨ ¬Q
    b) ¬P ∧ Q ≡ P ∨ Q
    c) ¬P ∨ Q ≡ P ∧ Q
    d) ¬(P ∨ Q) ≡ P ∧ Q
A

a) ¬(P ∧ Q) ≡ ¬P ∨ ¬Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  1. In a valid argument, if the premises are true, what can be said about the conclusion?
    a) The conclusion must also be true.
    b) The conclusion can be false.
    c) The truth value of the conclusion is unrelated to the premises.
    d) The conclusion must be false.
A

a) The conclusion must also be true.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  1. Which of the following is an equivalence rule?
    a) Modus Ponens
    b) Modus Tollens
    c) Double Negation
    d) Hypothetical Syllogism
A

c) Double Negation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  1. Using the Deduction Method, what can you infer from P→Q?
    a) Q
    b) ¬Q
    c) P ∧ Q
    d) ¬P
A

a) Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  1. Which of the following is an example of Modus Ponens?
    a) P→Q,¬Q⇒¬P
    b) P→Q,P⇒Q
    c) P ∨ Q,¬P⇒Q
    d) P ∧ Q,¬P⇒Q
A

b) P→Q,P⇒Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  1. Consider the verbal argument: “All humans are mortal. Socrates is human. Therefore, Socrates is mortal.” What type of reasoning does this use?
    a) Deductive reasoning
    b) Inductive reasoning
    c) Abductive reasoning
    d) Analogical reasoning
A

a) Deductive reasoning

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
  1. What is a proposition in logic?
    a) A sentence that is always true
    b) A declarative sentence that is either true or false
    c) A question or command
    d) A statement with no truth value
A

b) A declarative sentence that is either true or false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
  1. A contradiction is a proposition that is:
    a) Always true
    b) Sometimes true
    c) Always false
    d) Dependent on the context
A

c) Always false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  1. Using De Morgan’s Laws, simplify ¬(P∧Q):
    a) ¬P∨¬Q
    b) P∨Q
    c) ¬P∧Q
    d) P∧Q
A

a) ¬P ∨ ¬Q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  1. What is an invalid argument called?
    a) Tautology
    b) Fallacy
    c) Contradiction
    d) Equivalence
A

b) Fallacy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. Identify the form of the argument:
    Premises: P→Q,P
    Conclusion: Q
    a) Modus Ponens
    b) Modus Tollens
    c) Hypothetical Syllogism
    d) Disjunction Elimination
A

a) Modus Ponens

17
Q
  1. What is an invalid argument called?
    a) Tautology
    b) Fallacy
    c) Contradiction
    d) Equivalence
A

b) Fallacy

18
Q
  1. The inference rule “If P→Q and ¬Q, then ¬P” is known as:
    a) Modus Ponens
    b) Modus Tollens
    c) Hypothetical Syllogism
    d) Disjunction Introduction
A

b) Modus Tollens

19
Q
  1. What can be inferred from the premises P→Q and Q→R?
    a) P→R
    b) R→Q
    c) P→Q ∧ R
    d) Q→P
A

a) P→R

20
Q
  1. “Most people in this city are left-handed. John is from this city. Therefore, John is probably left-handed.” This is an example of:
    a) Deductive reasoning
    b) Inductive reasoning
    c) Abductive reasoning
    d) Circular reasoning
A

b) Inductive reasoning

21
Q

What type of reasoning is this?

Definition: A reasoning process where generalizations are made based on specific observations or evidence. It moves from specific instances to broader generalizations or theories.
Key Feature: The conclusion is probable but not guaranteed to be true, even if the premises are true.

A

inductive reasoning

22
Q

What type of reasoning is this?

Definition: A reasoning process where a conclusion logically follows from a set of premises. It moves from general principles to specific conclusions.
Key Feature: The conclusion is guaranteed to be true if the premises are true and the reasoning is valid.

A

Deductive Reasoning

23
Q

For each of the following, indicate whether it is a proposition or not:
(1) The sun sets in the west.
(2) Can you help me with this math problem?
(3) All humans have 12 fingers.
(4) Close the door, please.

A. (1) and (2) are propositions.
B. (1) and (3) are propositions.
C. (2) and (4) are propositions.
D. (3) and (4) are propositions.

A

B. (1) and (3) are propositions.

24
Q

Truth Table Row Count
How many rows will be in a truth table for a statement containing 4 variables?

A. 8
B. 16
C. 32
D. 4

A

B. 16

25
Q

Negate A ∧ B:

A. ¬A ∨ ¬B
B. A ∨ B
C. ¬A ∧ ¬B
D. ¬(A ∨ B)

A

A. ¬A ∨ ¬B

26
Q

Construct the truth table for A ∨ B and determine its final column for the following values of A and B:
A=T, B=F
A=F, B=T
A=T, B=T
A=F, B=F

A. T,T,T,F
B. F,T,T,T
C. T,F,F,F
D. F,F,T,T

A

A. T,T,T,F

27
Q

Which of the following logical statements is a tautology?

  1. A ∨ ¬A
  2. A ∧ ¬A
  3. A ∨ B ∨ C when A=T, B=F, C=F

A. Only 1
B. Only 2
C. Both 1 and 3
D. None

A

A. Only 1

28
Q

Which pair of logical statements is equivalent?
1. A ∧ (B ∨ C)
2. (A ∧ B) ∨ (A ∧ C)
3. A ∨ (B ∧ C)
4. (A ∨ B) ∧ (A ∨ C)

A. 1 and 2
B. 1 and 3
C. 2 and 4
D. 3 and 4

A

A. 1 and 2

29
Q

Simplify the following expression:
!(A ∨ B) ∧ B
A. ¬A ∧ B
B. ¬B
C. B
D. ¬A ∧ ¬B

A

D. ¬A ∧ ¬B

30
Q

Which of the following statements is always a contradiction?
1. A ∧ ¬A
2. A ∨ ¬A
3. (A ∨ B) ∧ (¬A ∧ ¬B)

A. 1 only
B. 3 only
C. Both 1 and 3
D. None

A

C. Both 1 and 3