in Mathematical Logic
375 views
1 vote
1 vote

Show without using a truth table that 

                         p V q

                           ~ p

 ----------------------------------------------------------------

                          ∴  q

in Mathematical Logic
375 views

2 Answers

1 vote
1 vote
Best answer
The premises must be true. So, pVq is true and p' is true.

So, p is false. So, q must be true.

Hence, proved.
selected by
1 vote
1 vote
To show this we have to prove that ......

((p v q) ∧ ∽p )→q  is a tautology

Now this equals

∽((p v q) ∧ ∽p )∨ q

≅ (∽p ∧ ∽q) v p v q

Now distributing p over ∽p ∧ ∽q we get...

((p v ∽p)∧(p v ∽q )) v q

≅ p v ∽q v q

≅ p v 1

≅ 1

Hence it is a tautology
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true