Register

MadeEasy Workbook: Mathematical Logic - Propositional Logic

• edited by
537 views
0 0 votes

Show that each of the conditional statement is a tautology NOT using a truth table

$r\vee (p\vee q)$ is the conclusion from the premises $(p \vee q) \wedge(q\rightarrow r)\wedge (p\rightarrow m) \wedge (m')$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · regular expressionsNext → · NPTEL Question
← Previous in category · sets and relationsNext in category → · doubt
Position:
Show:

Related questions

1 1 vote
1 1 answer
671
671 views
eyeamgj asked Jul 3, 2017
671 views
MadeEasy Workbook: Mathematical Logic - Propositional Logic
<p>what is the negation of:</p <p>x is prime iff x is not composite.</p <p>a.x is prime and x is not composite or x is not prime and x is composite.</p <p>b.x is prime an...
0 0 votes
0 0 answers
561
561 views
Kartik jain 1 asked Jan 8, 2019
561 views
Madeeasy Workbook
Prove that :∀x(P(x) = Q(x)) == ( ∃x(P(x)) = ∃x(Q(x)) )Why it does not holds?
1 1 vote
1 1 answer
1.2k
1.2k views
Prince Sindhiya asked Jan 7, 2019
1,240 views
Zeal Test Series 2019: Mathematical Logic - Propositional Logic
Isn’t the 3) statement is wrong it should be [(p->r)^(q->r)]->[(p∨q)->r]\