Answer to Question #251303 in Discrete Mathematics for Henry

Discrete Mathematics

Question #251303

Build a Fully truth table and identify if tautology, Contradiction or Contingency

¬(¬(P∧Q)↔(¬P)∨(¬Q))

Expert's answer

From table it is clear that: $¬(¬(P∧Q)↔(¬P)∨(¬Q))$ is a contradiction.

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. Make a Fully truth table and Show that they are logically equivalent⌐ (⌐p ∧ q) ∧ (p ∨q) �
2. find an increase in sequence of maximal links in a decrease in sequence of a maximal legs in a seque
3. Prove that n•P(n−1,n−1)= P(n,n).
4. Prove that for all integer n3, P(n+1,3)−P(n,3)=3P(n,2).
5. Establish the validity of the argument with the premises p -> (q -> r) , p \/ s , t ->q , ~
6. How many subsets of the set {1, 2, 3, 4, 5, 6, 7, 8} do not contain two consecutive integers ?
7. In a class of nn students (we consider all students as distinct), we want to make kk groups wher