Register

Discrete Mathematics

• edited by
873 views

2 Answers

Best answer
3 3 votes
p q p → q p ∧ ( p → q ) (p ∧ ( p → q )) → q
0 0 1 0 1
0 1 1 0 1
1 0 0 0 1
1 1 1 1 1

Since , all are 1, hence tautology

• selected by
2 2 votes

(p ∧ ( p → q )) → q

≡(p ∧ ( ~ p ∨ q )) → q

≡~(p ∧ ( ~ p ∨ q ))  ∨ q

≡(~p ∨ (  p ∧ ~q ))  ∨ q

≡(~p ∨ p ) ∧ ( ~p ∨ ~q ) ∨ q

≡( ~p ∨ ~q ) ∨ q

≡~p ∨ (~q ∨ q)

≡~p ∨ T

≡T

Hence,(p ∧ ( p → q )) → q is Tautology. 

Voting & Accepting an answer helps improve the community
← Previous · DISCRETE MATHEMATICSNext → · Gate Discrete
← Previous in category · DISCRETE MATHEMATICSNext in category → · Gate Discrete
Position:
Show:

Related questions

1 1 vote
1 1 answer
1.0k
1.0k views
admin asked Sep 28, 2024
1,024 views
ISRO CSE 2023 | Question: 29
The resulting logic circuit obtained when both inputs of NOR and NAND gates are connected together is:ANDXORORNOT 
0 0 votes
1 1 answer
1.8k
1.8k views
saba780 asked Apr 26, 2022
1,824 views
simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')
simplify the following logic functionf(ABC)USING k-MAP f(ABC)=(A+B+C') .(A+B'+C')
0 0 votes
1 answers 1 answer
939
939 views
go_editor asked Mar 26, 2020
939 views
UGC NET CSE | June 2005 | Part 2 | Question: 10
Identify the logic function performed by the circuit shownExclusive-$OR$$AND$Exclusive-$NOR$$NOR$
0 0 votes
1 1 answer
1.3k
1.3k views
Shawn Frost asked Apr 9, 2019
1,268 views
Test Book digital logic
I think option A is also correct !if we take minterm and complement it to get POS then option A can also be the answer