Discrete Mathematics - Mathematical Logic

11. Consider two well-formed formulas in propositional logic
F1 : P →˥P F2 : (P →˥P) v ( ˥P →)
Which of the following statement is correct?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


12. What can we correctly say about proposition P1:
P1 : (p v ˥q) ^ (q →r) v (r v p)

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


13. (P v Q) ^ (P → R )^ (Q →S) is equivalent to

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


14. The functionally complete set is

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


15. (P v Q) ^ (P→R) ^ (Q → R) is equivalent to

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *