Redirected
edited by
590 views
1 votes
1 votes

Consider the following two well-formed formulas in prepositional logic.

$F1 : P \Rightarrow \neg P$

$F2: (P \Rightarrow \neg P) \vee (\neg P \Rightarrow P)$

Which of the following statements is correct?

  1. $F1$ is Satisfiable, $F2$ is valid
  2. $F1$ is unsatisfiable, $F2$ is Satisfiable
  3. $F1$ is unsatisfiable,  $F2$ is valid
  4. $F1$ and $F2$ both are Satisfiable
edited by

2 Answers

0 votes
0 votes
Answer (1)

F1 evaluates to P' which is true at P = 0. However, at P = 1, it is equal to 0. Thus, F1 is satisfiable but not valid

F2 evalautes to 1 (valid) irrespective of the value of P.
Answer:

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
839 views
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
911 views
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...