Scribd
Upload
141 views3 pages

Review Questions Lecture 6 PDF

The document contains 15 practice questions about propositional logic including: 1) Identifying which statements are propositions. 2) Writing compound propositions as sentences and determining if they are true or false. 3) Writing propositional statements in symbolic form, including using logic operators like negation and conjunction. 4) Determining which statements are the negation of given propositions, using truth tables to check logical equivalences and tautologies, and representing conditional statements in propositional logic symbols.

Uploaded by

Shaboy De Marion
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
141 views3 pages

Review Questions Lecture 6 PDF

The document contains 15 practice questions about propositional logic including: 1) Identifying which statements are propositions. 2) Writing compound propositions as sentences and determining if they are true or false. 3) Writing propositional statements in symbolic form, including using logic operators like negation and conjunction. 4) Determining which statements are the negation of given propositions, using truth tables to check logical equivalences and tautologies, and representing conditional statements in propositional logic symbols.

Uploaded by

Shaboy De Marion
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Practice Questions

1. Which of the following are propositions?

(a) Buy Premium Bonds!


(b) The Apple Macintosh is a 16 bit computer.
(c) There is a largest even number.
(d) Why are we here?
(e) 8 + 7 = 13
(f) a + b = 13

2. Let ="1024 bytes is known as 1MB", and = "A computer keyboard is an


example of a data input device".Express the following compound propositions
as English sentences in as natural a way as you can. Are the resulting
propositions true or false?
(i) ∧ (ii) ∨ (iii) ¬

3. Let = " < 50"; = " > 40".Write as simply as you can:

(a) ¬
(b) ¬
(c) ∧
(d) ∨
(e) ¬ ∧
(f) ¬ ∧ ¬

One of these propositional forms always produces the output true, and one
always outputs false. Which ones?

4. In each part of this question a proposition p is defined. Which of the


statements that follow the definition correspond to the proposition ¬p? (There
may be more than one correct answer.)

(a)p is "Some people like Maths".

(i) "Some people dislike Maths"


(ii) "Everybody dislikes Maths"
(iii) "Everybody likes Maths"

(You may assume in this question that no-one remains neutral: they either like
or dislike Maths.)

(b) p is "The answer is either 2 or 3".


(i) "Neither 2 nor 3 is the answer"
(ii) "The answer is not 2 or it is not 3"
(iii) "The answer is not 2 and it is not 3"

(c) p is "All people in my class are tall and thin".

(i) "Someone in my class is short and fat"


(ii) "No-one in my class is tall and thin"
(iii) "Someone in my class is short or fat"

(You may assume in this question that everyone may be categorized


as either tall or short, either thin or fat.)

5. Construct the truth tables for the following forms:


(i) ¬ ∨ ¬
(ii) ∧ (¬ ∨ )
(iii) ∧ ( ∨ )
(iv) ( ∧ ) ∨

6. Using truth tables check the equivalences of the following pairs of prepositional
forms:
(a) ∨ ( ∧ ¬ ) and ∨ .
(b) (¬ ∧ ) ∨ ( ∧ ¬ ) and (¬ ∧ ¬ ) ∨ ( ∧ )

7. Simplify the following logical expressions.


(a) ¬ ∨ ¬ ∨ ( ∧ ∧ ¬ ) (b) ( ∧ ) ∨ ( ∧ ∧ ¬ ∧ ) ∨ (¬ ∧ )

8. Use Boolean Laws or truth tables to simplify as far as possible:


(a) ¬(¬ ∧ ¬ ) (b) ( ∧ ) ∨ ( ∧ ¬ ) ∨ (¬ ∧ ) (c) ( ∧ ¬ ) ∨

9. Let p, q and r represent conditions that will be true or false when a certain
computer program is executed. Suppose you want the program to carry out a
certain task only when p or q is true (but not both) and r is false.
Using p, q, r, ∧, ∨ and ¬, write a statement that will only be true under these
conditions.

10. Use truth tables to show that


¬ ( ∨¬ )∨ ∧( ∨¬ ) ≡¬ ∧

11. Use the laws of logical propositions to prove that:


(p ∧ q) ∧ [(q ∧ ¬r) ∨ (p ∧ r)] ≡ ¬(p → ¬q).

State carefully which law you are using at each stage.


12. Propositions p, q, r and s are defined as follows:
p is "I shall finish my Coursework Assignment"
q is "I shall work for forty hours this week"
r is "I shall pass Maths"
s is "I like Maths"

Write each sentence in symbols:

(a) I shall not finish my Coursework Assignment.


(b) I don’t like Maths, but I shall finish my Coursework Assignment.
(c) If I finish my Coursework Assignment, I shall pass Maths.
(d) I shall pass Maths only if I work for forty hours this week and finish my
Coursework Assignment.

13. Check whether or not each of the following is a tautology:


(a) → ( ∨ )
(b) ( → ) → ( → )
(c) ∧ ( → ) →
(d) ( ∧ ) →
(e) ↔ (¬ ∨ ¬ )

14. Draw up truth tables to show that → , ¬ ∨ and ¬ → ¬ are all


logically equivalent.

15. Build a truth table to check whether the following propositions are
contradictions (i) ( ↔ ) ∧ (¬ ∧ ) (ii) ¬ ∨ ¬( ∧ ) .

You might also like