2 output truth table For truth tables, i have no problem dealing with several inputs and one output but what if the truth table has two outputs instead? I want to write it in Boolean Algebra but i gave it a go and I'm not sure how it works for two outputs.
A|B|C|D|Z1|Z2
0|0|0|0| 1| 1
0|0|0|1| 0| 0
0|0|1|0| 1| 0

ABCD will be the input and Z1 and Z2 will be the two outputs. If it is only Z1 i can create the boolean algebra out of it but what if we have two outputs? Any help?
Z1 = A'B'C'D'
Z2 = A'B'C'D'??

 A: You would treat this problem the same way you would treat one with only one output: create two separate Karnaugh Maps, one for each output. I quickly made two with your example data which resulted in the following expressions:
Z1 = A'B'D' 
Z2 = A'B'C'D'
Here is a Wikipedia article on Karnaugh Maps if you are not familiar with them: https://en.wikipedia.org/wiki/Karnaugh_map
Sources: As an Electrical Engineering student I spent a lot of time creating logic circuitry with multiple outputs and this was the method I used.
Edit: I'm not sure if this was what you were trying to get at, but if you wanted Z1 to depend on Z2, you would simply add Z2 as an additional input to Z1's equation. I hope this helps!
A: For two outputs you need two expressions. If you were hoping/thinking that there would be one boolean expression that somehow captured that ... then stop thinking that: a single boolean expression captures one and only one truth-function, and that is what the 'outputs' are: truth-functions. So: different outputs, different expressions. 
