Question

DISCRETE MATH Show whether this is a tautology or not (without truth table): ((?→¬?)∧?)→¬? I get...

DISCRETE MATH

Show whether this is a tautology or not (without truth table):

((?→¬?)∧?)→¬?

I get false, but is that correct?

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Construct a truth table to determine whether the following expression is a tautology, contradiction, or a...
Construct a truth table to determine whether the following expression is a tautology, contradiction, or a contingency. (r ʌ (p ® q)) ↔ (r ʌ ((r ® p) ® q)) Use the Laws of Logic to prove the following statement: r ʌ (p ® q) Û r ʌ ((r ® p) ® q) [Hint: Start from the RHS, and use substitution, De Morgan, distributive & idempotent] Based on (a) and/or (b), can the following statement be true? (p ® q)...
MATH LOGICALL TRUTH TABLE/ be able to follow the comment if P implies Q , P...
MATH LOGICALL TRUTH TABLE/ be able to follow the comment if P implies Q , P is false , Q is true , the outcome P implies Q is true. I don't understand becasue P imples Q, if the P is false and Q is true, then the statement P===> Q should be false. Please explain or hold some example in sentences
Discrete Math There are 10 distinct books on a table. 2 are biology books, 2 are...
Discrete Math There are 10 distinct books on a table. 2 are biology books, 2 are math books, and the rest are engineering books. If a group of two books is picked, what is the probability that both math books are picked?
Use the FULL truth-table method to determine whether the following argument form is valid or invalid....
Use the FULL truth-table method to determine whether the following argument form is valid or invalid. Show the complete table (with a column of ‘T’s and ‘F’s under every operator); state explicitly whether the argument form is valid or invalid; and clearly identify counterexample rows, if there are any. (p ⋅ q) ⊃ ~(q ∨ p), p ⊃ (p ⊃ q) /∴ q ≡ p Use the FULL truth-table method to determine whether the following argument form is valid or...
In math logic Give the converse and contrapositive of the following propostions use truth table T...
In math logic Give the converse and contrapositive of the following propostions use truth table T & F -If the traffic light is red, then cars must stop. -If the fruit is red, then it is an apple. -Unrest is sufficient for change. -A right implies a responsibiility. -The right to search for the truth implies also a duty. -Speak only if it improves upon the silence.
Discrete Math Course 3. Decide and explain whether or not S is an equivalence relation on...
Discrete Math Course 3. Decide and explain whether or not S is an equivalence relation on Z , if ??? ??? 3 ??????? ?+2? 4. Find the transitive closure of the relation ?={(?,?),(?,?),(?,?),(?,?),(?,?)} on the set ?={?,?,?,?,?}. Draw a directed graph of ? (not its closure). 5. Decide and explain whether or not the set ?={?/4∶?∈?} is a countable
Can someone please explain how to get the answer for this discrete math problem Hillary, Aly,...
Can someone please explain how to get the answer for this discrete math problem Hillary, Aly, and Meredith are sitting in their favorite coffee shop when their waiter asks: "Does everyone want coffee?" Hillary replies "I don't know." Aly then replies "I don't know" as well. Finally, Meredith says "Not everyone wants coffee." The waiter comes back and gives a coffee to each person that wants one. Answer the following: Did Hillary get a coffee? 1) yes 2) no or...
Use a truth table to determine whether the two statements are equivalent. ~p->~q, q->p Construct a...
Use a truth table to determine whether the two statements are equivalent. ~p->~q, q->p Construct a truth table for ~p->~q Construct a truth table for q->p
I have a discrete math question. let R be a relation on the set of all...
I have a discrete math question. let R be a relation on the set of all real numbers given by cry if and only if x-y = 2piK for some integer K. prove that R is an equivalence relation.
discrete math (3) with full proof Use the Well Ordering principle to show that a set...
discrete math (3) with full proof Use the Well Ordering principle to show that a set S of positive integers includes 1 and which includes n+ 1, whenever it includes n, includes every positive integer.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT