My professor wants to convert propositional statements such as X ^ Y into polynomeals such as(adsbygoogle = window.adsbygoogle || []).push({});

P[(X^Y)] = xy

Now, we may have multiple propositional formulas and wish to determine if they are consistent or inconsistent using Boolean polynomials.

I'm having a tough time finding material on this subject online or on you tube. Could someone please give me links to texts or videos where logical propositions are converted to Boolean polynomials and how they are used in proving consistency and inconsistency in a set of propositional formulas.

Also, I have some trouble converting statements such as

[ (p->q) -> (q->r) ] -> (p->r)

into Boolean polynomials.

Again, I'm looking for material covering the above scenarios. It would be much appreciated.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Boolean polynomials in logic

Loading...

Similar Threads - Boolean polynomials logic | Date |
---|---|

I Predicting new polynomials from known ones | Oct 4, 2017 |

Prove A.(B+C) = (A.B)+(A.C) <Boolean Algebra> | Oct 24, 2015 |

Simplifying a 4-term equation using boolean algebra | Sep 12, 2015 |

Transformation rules in Boolean algebra | Mar 31, 2015 |

Effectiveness of a Boolean test | Sep 20, 2013 |

**Physics Forums - The Fusion of Science and Community**