Scribd
Upload
14 views3 pages

Assignment#2

The document contains 17 multi-part logic and boolean algebra problems involving propositional logic, logical equivalences, and boolean expressions. Students are asked to determine truth values, write statements in English form, use logic diagrams and Karnaugh maps, and evaluate boolean circuits.

Uploaded by

20230551
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
14 views3 pages

Assignment#2

The document contains 17 multi-part logic and boolean algebra problems involving propositional logic, logical equivalences, and boolean expressions. Students are asked to determine truth values, write statements in English form, use logic diagrams and Karnaugh maps, and evaluate boolean circuits.

Uploaded by

20230551
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

Assignment#2

Propositional Logic Questions


1) Suppose that the statement p → ¬q is false. Find all combinations of truth values of
r and s for which (¬q → r) ∧ (¬p ∨ s) is true.

2) If the statement q ∧ r is true, determine all combinations of truth values for p and s
such that the statement (q → [¬p ∨ s]) ∧ [¬s → r] is true.

3) Find all combinations of truth values for p, q and r for which the statement ¬p ↔
(q ∧ ¬(p → r)) is true.
4) Is (p → q) → [(p → q) → q] a tautology? Why or why not?

5) Show that ( ) ( ) ( ) is a tautology by making a truth table, and then


again by using an argument that considers the two cases " is true" and " is false".

6) Write each of the following statements, in English, in the form “if p, then q”.
(a) I go swimming on Mondays.
(b) In order to be able to go motorcycling on Sunday, the weather must be good.
(c) Eat your vegetables or you can’t have dessert.
(d) You can ride a bicycle only if you wear a helmet.
(e) Polynomials are continuous functions.
(f) A number n that is a multiple of 2 and also a multiple of 3 is a multiple of 6.
(g) You can’t have any pudding unless you eat your meat.
(h) The cardinality of a set is either finite or infinite.

7) Write in English the converse, contrapositive and negation of each statement.


(a) If I had $1,000,000, I’d buy you a fur coat.
(b) If it is not raining and not windy, then I will go running or cycling.
(c) A day that’s sunny and not too windy is a good day for walking on the waterfront.
(d) If 11 pigeons live in 10 birdhouses, then there are two pigeons that live in the same
birdhouse.
(f) If every domino covers a black square and a white square, then the number of
black squares equals the number of white squares.

8) (a) Use any method to show that ¬(p → q) ↔ (p ∧ ¬q) is a tautology.


(b) Use known logical equivalences to show that ¬(p ↔ q) ⇔ (p ∨ q) ∧ (¬p ∨ ¬q).

9) Use known logical equivalences to show that (¬a → b) ∧ (¬b ∨ (¬a ∨ ¬b)) is logically
equivalent to ¬(a ↔ b).
1

10) Use known logical equivalences to show that ¬(p ↔ q) is logically equivalent to
(p ∨q) ∧ (p → ¬q).
11) Use known logical equivalences to do each of the following.
(a)Show p → (q ∨ r) ⇔ (p ∧ ¬q) → r.
(b) Show ¬(p ∨ q) ∨ (¬p ∧ q) ∨ ¬(¬p ∨ ¬q) ⇔ ¬(p ∧ ¬q).
(c) Find an expression logically equivalent to ¬(p ↔ q) that involves only ¬ and ∨.

12) Write the argument below in symbolic form. If the argument is valid, prove it. If the
argument is not valid, give a counterexample:

(a)

If I watch football, then I don’t do


mathematics If I do mathematics, then I
watch hockey
∴ If I don’t watch hockey, then I watch football

(b)

If you are pregnant or have a heart condition, then you cannot use the hot tub.
You do not have a heart condition.
You can use the hot tub.
∴ You are not pregnant.

Boolean Algebra

13) For each of the following Boolean expressions, simplify –if possible- then draw a logic
diagram
a)
b)
c)
d) ( ) ( )

14) Use a K-map to find a minimal expansion as a Boolean sum of Boolean products of
each of these functions of the Boolean variables and .
a) ̅ ̅̅
b) ̅
c) ̅ ̅ ̅ ̅

15) Use a K-map to find a minimal expansion as a Boolean sum of Boolean products of
each of these functions in the variables , , and .
a) ̅ ̅ ̅
2
b) ̅ ̅ ̅ ̅
c) ̅ ̅ ̅ ̅ ̅ ̅̅
d) ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅
16) Use a K-map to find a minimal expansion as a Boolean sum of Boolean products of
each of these functions in the variables , , , and .
a) ̅ ̅̅ ̅ ̅ ̅ ̅
b) ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅
c) ̅ ̅ ̅̅ ̅ ̅ ̅ ̅ ̅ ̅̅ ̅ ̅ ̅ ̅
d) ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅ ̅

17) Find the output of the given circuit.

You might also like