Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Consider two well-formed formulas in preposit... Start Learning for Free
Consider two well-formed formulas in prepositional logic.
Q. 
Which of the following statements is correct?    
  • a)
    F1 is satisfiable, F2 is valid
  • b)
    F1 unsatisfiable, F2 is satisfiable
  • c)
    F1 is unsatisfiable, F2 is valid
  • d)
    F1 and F2 are both satisfiabl
Correct answer is option 'A'. Can you explain this answer?
Verified Answer
Consider two well-formed formulas in prepositional logic.Q.Which of th...
The concept behind this solution is: a) Satisfiable If there is an assignment of truth values which makes that expression true. b) UnSatisfiable If there is no such assignment which makes the expression true c) Valid If the expression is Tautology Here, P => Q is nothing but –P v Q F1: P => -P = -P v –P = -P F1 will be true if P is false and F1 will be false when P is true so F1 is Satisfiable F2: (P => -P) v (-P => P) which is equals to (-P v-P) v (-(-P) v P) = (-P) v (P) = Tautology So, F1 is Satisfiable and F2 is valid Option (a) is correct.
View all questions of this test
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer?
Question Description
Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer?.
Solutions for Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider two well-formed formulas in prepositional logic.Q.Which of the following statements is correct? a)F1 is satisfiable, F2 is validb)F1 unsatisfiable, F2 is satisfiablec)F1 is unsatisfiable, F2 is validd)F1 and F2 are both satisfiablCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev