Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


Wasell
Posts:
8
Registered:
9/29/10


Re: How to map a Table of a Propositional Calculu s wff=3Fs values to that wff [Important Data Manipula tion Problem]?
Posted:
Dec 17, 2012 8:09 AM


On Fri, 14 Dec 2012 05:57:31 0800 (PST), in article <a11ee1a7443d 49638b885b5071a9f5f7@r3g2000vbn.googlegroups.com>, CharlieBoo wrote: [...] > There is easily a wff of ORs of ANDs of sets of variable or their > negations, such as: > > (~P ^ Q ^ R) v ( P ^ ~Q ^ R) v (P ^ Q ^ ~R) (1) > > where each disjunct (OR argument) represents a tuple (P,Q,R) for which > the WFF = 1 in the table (3 rows.)
http://en.wikipedia.org/wiki/Disjunctive_normal_form
> I want a wff of ANDs of ORs of sets of variables and their negations > e.g.: > > ( P ) ^ ( ~Q v R ) ^ (P v ~R) ^ (~P v Q v R) (2)
http://en.wikipedia.org/wiki/Conjunctive_normal_form



