Scribd
Upload
1 views1 page

Assgn 3

The document is an assignment focused on discrete mathematics, specifically verifying various logical laws using truth tables. It includes exercises related to commutative, associative, distributive, and absorption laws, as well as De Morgan's laws and unique existence quantifiers. Additionally, it poses questions about truth values for specific statements within defined domains of integers.

Uploaded by

arsalanhabib13
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
1 views1 page

Assgn 3

The document is an assignment focused on discrete mathematics, specifically verifying various logical laws using truth tables. It includes exercises related to commutative, associative, distributive, and absorption laws, as well as De Morgan's laws and unique existence quantifiers. Additionally, it poses questions about truth values for specific statements within defined domains of integers.

Uploaded by

arsalanhabib13
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/ 1

DISCRETE MATHEMATICS –ASSIGNMENT NO.

EXERCISE 1.3 instead using only negations, disjunctions,


3. Use truth tables to verify the and conjunctions.
commutative laws c) ￢∃x P(x)
a) p ∨ q ≡ q ∨ p.
d) ￢∀x P(x)
b) p ∧ q ≡ q ∧ p.
e) ∀x ((x≠3) → P(x)) ∨ ∃x ￢P(x)
4. Use truth tables to verify the associative
laws 52. As mentioned in the text, the notation
a) ( p ∨ q) ∨ r ≡ p ∨ (q ∨ r). ∃! x P(x) denotes
b) ( p ∧ q) ∧ r ≡ p ∧ (q ∧ r). “There exists a unique x such that P(x) is
true.”
5. Use a truth table to verify the distributive If the domain consists of all integers, what
law p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r). are the truth values of these statements?
b) ∃!x(x2 = 1)
6. Use a truth table to verify the first De c) ∃!x (x + 3 = 2x)
Morgan law ￢ (p ∧ q) ≡ ￢ p ∨￢ q. d) ∃!x(x = x + 1)

13. Use truth tables to verify the absorption EXERCISE 1.5


laws.
a) p ∨ (p ∧ q) ≡ p 26. Let Q(x, y) be the statement “x + y = x
− y.” If the domain for both variables
b) p ∧ (p ∨ q) ≡ p consists of all integers, what are the truth
values?
EXERCISE 1.4 g) ∃y ∀x Q(x, y)
11. Let P(x) be the statement “x = x2.” If h) ∀y ∃x Q(x, y)
the domain consists of the integers, what
are these truth values? i) ∀x ∀y Q(x, y)
d) P (−1)

e) ∃x P(x)

f ) ∀x P(x)

17. Suppose that the domain of the


propositional function P(x) consists of the
integers 0, 1, 2, 3, and 4. Write out each of
these propositions using disjunctions,
conjunctions, and negations.
d) ∀x ￢P(x)

e) ￢∃x P(x)

f ) ￢∀x P(x)

19. Suppose that the domain of the


propositional function P(x) consists of the
integers 1, 2, 3, 4, and 5. Express these
statements without using quantifiers,

You might also like