edited by
8,945 views
30 votes
30 votes

Consider two well-formed formulas in propositional logic

$F_1: P \Rightarrow \neg P$          $F_2: (P \Rightarrow \neg P) \lor ( \neg P \Rightarrow P)$

Which one of the following statements is correct?

  1. $F_1$ is satisfiable, $F_2$ is valid
  2. $F_1$ unsatisfiable, $F_2$ is satisfiable
  3. $F_1$ is unsatisfiable, $F_2$ is valid
  4. $F_1$ and $F_2$ are both satisfiable
edited by

5 Answers

–1 votes
–1 votes
I can see both are satisfiable i wl go for option b
Answer:

Related questions

25 votes
25 votes
2 answers
1
Kathleen asked Sep 14, 2014
10,425 views
Which of the following requires a device driver?RegisterCacheMain memoryDisk
37 votes
37 votes
3 answers
2
Kathleen asked Sep 14, 2014
12,507 views
Where does the swap space reside?RAMDiskROMOn-chip cache
36 votes
36 votes
2 answers
3
Kathleen asked Sep 14, 2014
12,525 views
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called...
25 votes
25 votes
2 answers
4