Wolfram|Alpha

Computing...

Truth table:

P | Q | R | P && (Q || R)\nT | T | T | T\nT | T | F | T\nT | F | T | T\nT | F | F | F\nF | T | T | F\nF | T | F | F\nF | F | T | F\nF | F | F | F


Minimal forms:

DNF | (P && Q) || (P && R)\nCNF | P && (Q || R)\nANF | (P && Q) xor (P && R) xor (P && Q && R)\nNOR | ¬P nor (Q nor R)\nNAND | (P nand Q) nand (P nand R)\nAND | P && ¬(¬Q && ¬R)\nOR | ¬(¬P || ¬Q) || ¬(¬P || ¬R)


Other forms:

ESOP | (P && R) xor (P && Q && ¬R)\nITE | P && (Q || (¬Q && R))


Logic circuit:



Venn diagram:



Truth density:

3\/8=37.5%


Boolean operator number:

224 with variable ordering {P, Q, R}


Rule 224 elementary cellular automaton evolution:


ComputingComputing...