At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
here we are again :P
\(p → (p ∧ (q → p))\) lets create the table quick
we're creating the table to write out PDNF okay
We can just read the table from there? just include the picture or something.
For PDNF simply take the rows with T
Here all rows have T
therefore the PDNF is p'q' + p'q + pq' + pq
replace + with OR gate multiplication with AND gate ' with NOT gate
you mean to say all rows with atleast 1 T ? or the last column ?
which column represents the given boolean expression ?
that is the reason i have asked you to create teh truth table
so you only look at the last column
the other columns help you create that last column ok
can't believe it is this easy :| DNF is more diffficult than this :O atleast we use theorems and all there
the other columns are like scratch work
these are easy once you understand the logic
and what would be the modification in case of PCNF ?
for PCNF you consider the rows with F
are there any rows with F ?
the expression always evaluates to True
it doesn't depend on the logic values of p and q
yep so its a tautology
it is like the function : f(p, q) = 1
im not so sure with ur termonilogy.... the boolean algebra i am familiar with comes from digital circuit design
alright..I've covered alot of things :) all thanks to you :D
np :) have good sleep tonight so that you will be fresh tomoro
yep..going to sleep soon :P just have to revise graph theory n good to go. will remember you name before starting the exam :P