The Gateway to Computer Science Excellence
+19 votes
1.7k views

The following propositional statement is  $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$

  1.    satisfiable but not valid
  2.    valid
  3.    a contradiction
  4.    None of the above
in Mathematical Logic by Veteran (52.2k points)
edited by | 1.7k views

1 Answer

+23 votes
Best answer
Answer a

It is false when P = T, Q = T, R = F

It is true (satisfiable) when P = T. Q = T, R = T
by Loyal (5.7k points)
selected by
0
what does it means '' not valid '' in option a ?????
+27

Tautology: A tautology is a proposition that is always ture. 

ex: (p  v ~p)= T

Contradiction: A contradiction is a proposition that is always false.

ex: (p ^ ~p)=F

Contigency: A contigency is a proposition that is neither a tautology nor a contradiction.

ex: (p v q)----> ~r

* A propositional logic is said to be satisfiable if it is either a tautology or contigency.

* If logic is contradiction then it is said to be unsatisfiable.

* By contigency we means the logic can be ture or false.

* Contradiction is the unsatisfiable function.

* Statement is valid means tautology.

* Statement is not valid means not tautology.

+2
You can reduce the equation to $P' + Q' + R$ by using $A \rightarrow B \equiv A' + B$

Related questions

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
50,647 questions
56,461 answers
195,358 comments
100,245 users