Discussion
Consider two well-formed formulas in propositional logic
F1 : P → ˥P F2 : (P → ˥P) v (˥P → P)
Which of the following statement is correct?
Answer: C
Correct answer: F1 is satisfiable, F2 is valid
F1 is \( P \to \lnot P \), which reduces to \( \lnot P \); that is true when P is false, so F1 is satisfiable though not valid. F2 is \( (P \to \lnot P) \lor (\lnot P \to P) \), which reduces to \( \lnot P \lor P \) and is therefore true in every case, so F2 is valid.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development