Scribd
Upload
9 views

Q Logic Chapter 1

Uploaded by

abebechabebe1111
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views

Q Logic Chapter 1

Uploaded by

abebechabebe1111
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Assessment Questions on Chapter 1: Propositional Logic

Multiple-Choice Questions

1. What is a proposition?

a) A sentence that is always true

b) A sentence that can be either true or false

c) A sentence with no truth value

d) A command or exclamation

2. Which of the following is NOT a proposition?

a) The Earth revolves around the Sun.

b) What is your favorite color?

c) 2 + 2 = 4

d) 7 > 3

3. A compound proposition is formed by:

a) Using variables instead of constants

b) Joining two or more propositions with logical connectives

c) Replacing a proposition with a truth table

d) Finding the truth value of a statement

4. What is the logical connective for "and"?

a) ¬

b) ∨

c) ∧
d) ⇒

5. The truth table for p ∧q shows the result as true only when:

a) p is true and q is false

b) Both p and q are true

c) Both p and q are false

d) p is false and q is true

6. What is the result of p ∨q when p is false and q is true?

a) True

b) False

c) Undefined

d) Cannot be determined

7. The negation of a proposition p is represented as:

a) p ∨ q

b) ¬ p

c) p ∧ q

d) p⇒q

8. Which of the following truth tables represents a tautology?

a) A table where all entries are false

b) A table where at least one entry is true

c) A table where all entries are true

d) A table with no true values


9. What is a contradiction in logic?

a) A proposition that is sometimes true

b) A proposition that is always false

c) A proposition that is always true

d) A proposition with an unknown truth value

10. The logical expression p implies q is false when:

a) is true and is true

b) is false and is false

c) is true and is false

d) p is false and q is true

11. The converse of \( p \implies q \) is:

a) q ⇒ p

b) ¬p ⇒ ¬q

c) q⇒ ¬p

d) ( p ∨q )

12. The contrapositive of p ⇒q is:

a) ¬ p⇒ q \)

b) ¬q ⇒ ¬p \)

c) ( q ⇒ p )

d) ¬p ∨ q )
13. What is the bi-implication of \( p \iff q \)?

a) True only when p is true

b) False only when q is false

c) True when p and q have the same truth value

d) False when p is true and q is true

14. De Morgan’s Laws state that:

a) (¬ p ∨ q) = ¬ p ∧ ¬q

b) ¬ (p ∨q) = ¬ p∨ ¬ q

c) ¬ (p ∧ q) = (¬ p ∨ ¬ q
d) Both a and c

15. A compound proposition that is always true is called:

a) A contradiction

b) A tautology

c) A contingency

d) A hypothesis

16. Which of the following is a universal quantifier?

a) \( \exists \)

b) \( \forall \)

c) \( \∨r \)

d) \( \land \)
17. The negation of \( \forall x P(x) \) is equivalent to:

a) \( \forall x ¬ P(x) \)

b) \( ¬ P(x) \∨ x \)

c) \( \exists x ¬ P(x) \)

d) \( ¬ P(x) \∧ x \)

18. What does the existential quantifier \( \exists x P(x) \) mean?

a) For all \( x \), \( P(x) \) is true

b) There exists at least one \( x \) for which \( P(x) \) is true

c) For some \( x \), \( P(x) \) is false

d) For no \( x \), \( P(x) \) is true

19. Which of the following is an example of a predicate?

a) \( x > 5 \)

b) \( 3 > 2 \)

c) \( 2 + 2 = 4 \)

d) \( ¬ x \)

20. The relationship between existential and universal quantifiers is such that:

a) The negation of \( \forall x P(x) \) is \( \exists x \neg P(x) \)

b) The negation of \( \exists x P(x) \) is \( \forall x \neg P(x) \)

c) Both a and b

d) None of the above

21. What is the truth value of \( ¬ (\forall x P(x)) \) if \( P(x) \) is true for some \( x \)?
a) True

b) False

c) Cannot be determined

d) True for all \( x \)

22. The set of all allowable values for a variable in a proposition is called:

a) Predicate

b) Universal set

c) Domain

d) Range

23. Which of the following is an example of a tautology?

a) \( p ∨\¬ p \)

b) \( p ∧\¬ p \)

c) \( p \iff \¬ p \)

d) \( \¬ p \lor q \)

24. If \( P(x) \) is an open proposition, then \( \exists x P(x) \):

a) Converts \( P(x) \) into a true statement

b) Converts \( P(x) \) into a quantified statement

c) Converts \( P(x) \) into a tautology

d) Converts \( P(x) \) into a contradiction

25. A proposition is equivalent if:

a) It is a tautology
b) It is a contradiction

c) It has the same truth value for all conditions

d) It is never true

---

### **Answer Key**

1. b

2. b

3. b

4. c

5. b

6. a

7. b

8. c

9. b

10. c

11. a

12. b

13. c

14. d

15. b

16. b

17. c

18. b
19. a

20. c

21. a

22. c

23. a

24. b

25. c

Let me know if you'd like this formatted into a PDF!

You might also like