Register

GATE CSE 2001 | Question: 1.3

• edited by
9,080 views
31 votes
31 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
User Avatar

5 Answers

–1 votes
–1 votes
I can see both are satisfiable i wl go for option b
User Avatar
Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

25 votes
25 votes
2 answers
1
Kathleen asked Sep 14, 2014
10,508 views
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
User Avatar
37 votes
37 votes
3 answers
2
Kathleen asked Sep 14, 2014
12,659 views
GATE CSE 2001 | Question: 1.20
Where does the swap space reside? RAM Disk ROM On-chip cache
Where does the swap space reside?RAMDiskROMOn-chip cache
User Avatar
36 votes
36 votes
2 answers
3
Kathleen asked Sep 14, 2014
12,602 views
GATE CSE 2001 | Question: 1.17
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 Assembly parsing Relocation Symbol resolution
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...
User Avatar
25 votes
25 votes
2 answers
4
Kathleen asked Sep 14, 2014
4,982 views
GATE CSE 2001 | Question: 1.15
Consider any array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i$ of the array $(i \leq n)$, the index of the parent is $i-1$ $\lfloor \frac{i}{2} \rfloor$ $\lceil \frac{i}{2} \rceil$ $\frac{(i+1)}{2}$
Consider any array representation of an $n$ element binary heap where the elements are stored from index $1$ to index $n$ of the array. For the element stored at index $i...
User Avatar
Link Copied!