Find the transitive closure A={1,2,3,4,5}
R={ (2,3),(3,5),((1,2),(2,5),(1,3),(4,5),(5,2)} by using Warshall’s Algorithm.
Find these terms of the sequence (An}, where An = 2(3)n + 5
a recursive function is defined by can=2an-1 with a0=1. find the value of a3
Show that ¬ (P"\\iff"Q)"\\iff"(P V Q) Λ ¬(P Λ Q) "\\iff"(P Λ ¬Q) V (¬ P Λ Q) without using truth table
whether each of these functions is a bijection from R to R. f (x) = x 3 -1
∃𝑥 (𝑥 + 1 = 0 ∨ 𝑥 + 2 = 0) write the negation of the following
Let Q(x) be the statement “x + 1 > 2x.” If the domain consists of all integers, what are these truth values? a) Q(0) b) Q(−1) c) Q(1) d) ∃xQ(x) e) ∀xQ(x) f) ∃x¬Q(x) g) ∀x¬Q(x)
Establish the validity of the argument with the premises p -> (q -> r) , p \/ s , t ->q , ~s and ~r -> ~t