Suppose the domain of the propositional function P(x) consists of the integers −2,
−1, 0, 1, 2. Write out each of these propositions using disjunctions, conjunctions, and
negations.
a) ∃xP(x)
b) ∀xP(x)
c) ∃x¬P(x)
d) ∀x((x ≠ 1) → ¬P(x))
Suppose there are signs on the doors to two rooms. The sign on the first door reads “In this
room there is a lady, and in the other one there is a tiger”; and the sign on the second door
reads “In one of these rooms, there is a lady and in one of them there is a tiger.” Suppose
that you know that one these signs is true, and the other is false. Behind which door is the
lady? Explain your reasoning using propositions.
A compound proposition is satisfiable if there is an assignment of truth values to its
variables that makes it true (that is when it is a tautology or a contingency)
Determine whether the compound proposition is satisfiable:
(p → q) ∧ (p → ¬q) ∧ (¬p → q) ∧ (¬p → ¬q)
Construct a truth table for each of these compound propositions
(p → q) ⊕ (¬p ↔ ¬r)
How many strings begin with the letter F and do not end with EB ?
Draw flow charts to this questions.
Exercise 1.
Exercise 2.
Exercise 3.
Directions: Read each statement carefully, show your complete solution if needed.
1. Write the Converse, Inverse, and Contrapositive of: "If 25 is an integer, then 25 is a rational number."
2. Use De Morgan's laws to write the given statements in their equivalent form: "Either I will not vote for you or I will not campaign for you"
3. Use a truth table to show that p ‹—› q = [(p —› q) ^ (q —› p)].
4. Write the argument in symbolic form (row form), use a truth table to determine if the argument is valid or invalid.
5. Use Euler diagram to determine whether the argument is valid or invalid. "All square are not triangles. Some triangles are equilateral. All squares are not equilateral."
List the members of these sets.
{ x | x is a real number such that x2 = 1}
Given R is a relation from A = {1,2,3,4,5}, R={(1,1),(2,2),(2,3),(2,4),(3,3),(4,4),(4,5)}.
Is R an equivalence relation?
Calculate the total number of words that can be formed using the
letters of the word “MISSIPPI” if two ‘S’ and two ‘I’ are adjacent to
each other.