- **Applied Math**
(*http://mymathforum.com/applied-math/*)

- - **Simplification Normal Form - predicate logic**
(*http://mymathforum.com/applied-math/46959-simplification-normal-form-predicate-logic.html*)

Simplification Normal Form - predicate logicHi! Can you please help me solve this question? (p → (q Λ r V s)) → ((p → q) V (r V s)) Convert into Disjunctive Normal Form(DNF) and Conjunctive Normal Form(CNF). Thank you in advance.. :) |

Have you seen any examples of similar problems? What have you tried? Is q Λ r V s parsed as (q Λ r) V s or as q Λ (r V s)? Are you allowed to use truth tables? Then construct a truth table and select rows where the value of the formula is 1. For example, suppose this happens when p = T, q = F, r = T and s = F. To such row corresponds the disjunct $p\land \neg q\land r\land\neg s$. Collect all such disjuncts into a disjunction. That would be the DNF. |

All times are GMT -8. The time now is 02:59 PM. |

Copyright © 2019 My Math Forum. All rights reserved.