Boolean Algebra Simplification Property Question

AI Thread Summary
The discussion centers on simplifying the Boolean expression r*c'w + c to c + wr, confirming their equivalence. The simplification utilizes the distributive property of OR over AND and the complementation principle, specifically x OR x' = 1. Participants clarify that this is not homework but a practice problem. Additionally, it is noted that two Boolean expressions are functionally equivalent if they have identical truth tables. The conversation concludes with the affirmation that equivalent expressions can be reduced to identical forms.
Bigworldjust
Messages
53
Reaction score
0
Hi I am not sure where to post this question but I am trying to simplify this expression:

r*c'w+c (As in R AND NOT C AND W OR C) to c+wr (As in C OR W AND R) and I know that it simplifies to this and they are both equivalent; however my question is which boolean simplification property is used here? Is it the Absorption principle? Thank you!
 
Physics news on Phys.org
No, I don't think so. It follows from the distributive property of OR over AND, combined with the compementation principle x OR x' = 1.

Is this homework?
 
MisterX said:
No, I don't think so. It follows from the distributive property of OR over AND, combined with the compementation principle x OR x' = 1.

Is this homework?

No it's a worked example left for us to solve if we wanted extra practice. And that's what I thought initially. So it is using the distributive property and then the complement theory. Thank you.
 
Also one last question. When expressions are functionally equivalent like the two above, can they always be reduced to being identical? I am assuming yes, because they are equal to begin with, correct?
 
Two Boolean expressions that have the same variables are equal if and only if they have identical truth tables.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top