Scribd
Upload
24 views2 pages

Discrete Mathematics - Logic Exercises

The document contains a series of exercises related to propositional logic and proofs in a Computer Science study program. It includes tasks such as evaluating propositional formulas, constructing truth tables, determining the validity of arguments, and proving statements by direct proof and contraposition. Additionally, it involves expressing negations of propositions using quantifiers.

Uploaded by

10423030
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
24 views2 pages

Discrete Mathematics - Logic Exercises

The document contains a series of exercises related to propositional logic and proofs in a Computer Science study program. It includes tasks such as evaluating propositional formulas, constructing truth tables, determining the validity of arguments, and proving statements by direct proof and contraposition. Additionally, it involves expressing negations of propositions using quantifiers.

Uploaded by

10423030
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/ 2

Study program: Computer Science, VGU

Algebra

Exercise Sheet: Logic


1. Let consider the interpretation v where v(p) = F, v(q) = T, v(r) = T .
Does v satisfy the following propositional formulas?

(a) (p ⇒ ¬q) ∨ ¬(r ∧ q)


(b) (¬p ∨ ¬q) ⇒ (p ∨ ¬r)
(c) ¬(¬p ⇒ ¬q) ∧ r
(d) ¬(¬p ⇒ q ∧ ¬r)

2. Construct a truth table for the formula ¬p ∧ (p ⇒ q).

3. Show that (p ⇒ q) ∨ (q ⇒ p) is a tautology.

4. Construct a truth table for (p ⇒ q) ∧ (q ⇒ r).

5. Write down the negation of the following statements, simplifying so


that only simple statements are negated.

(a) p ∨ ¬q
(b) (p ∧ q) ⇒ r

6. Construct a truth table for (¬A ∨ B) ⇒ (¬C ∧ D).

7. Use a truth table to determine the validity of the argument: If Tweety


is a bat then Tweety can fly. Tweety is not a bat. Therefore, Tweety
can not fly.

8. Use a truth table to determine the validity of the argument:


If Joe studies hard, he will make the dean’s list. Joe made the Dean’s
list. Therefore, Joe studied hard.

9. Determine the validity of the argument:


If Joe can afford it, he will ask Sally to go out on a date. If Bill pays
Joe the money he owes him then Joe can afford to go out on a date.
Joe does not ask Sally to go out on a date. Therefore, Bill did not pay
Joe the money he owes him.

10. Determine the validity of the argument:


If you have high blood pressure then you are at risk for having a stroke.
Lynn has high blood pressure. Therefore, Lynn is at risk for having a
stroke.
11. Prove the following statements by direct proof

(a) The product of two odd number integers is odd.


(b) The product of two invertible matrices is invertible.

12. Prove that following statements by contraposition.

(a) If a product of two positive real numbers is greater than 100, then
at least one of the number is greater than 10.
(b) There is no greatest even integer.

13. Use the truth table to determine if p ∧ ¬q → p ∧ q is a logical conse-


quence of the formula ¬p.

14. Check if each of the following statements is satisfiable or not

(a) If new messages are not queued, then they will be sent to the
message buffer.
(b) (¬p ∨ q) ∧ (q → ¬r ∧ ¬p) ∧ (p ∨ r)

15. Express the negation of these propositions using quanti-fiers, and then
express the negation in English.

(a) Some old dogs can learn new tricks.


(b) No rabbit knows Algebra.
(c) Every bird can fly.
(d) There is no dog that can talk.
(e) There is no one in this class who knows German and Spanish.

You might also like