Mathematics Stack Exchange
Mathematics Stack Exchange

Questions tagged [boolean-algebra]

Boolean algebras are structures which behave similar to a power set with complement, intersection and union. Use this tag for questions about Boolean algebras as structures, or about functions defined from/to Boolean algebras. For Boolean logic use the tag propositional-calculus.

Boolean algebras are structures which behave similar to a power set with complement, intersection and union. Use this tag for questions about Boolean algebras as structures, or about functions defined from/to Boolean algebras.

A Boolean algebra uses Boolean variables, typically denoted by capital letters, e.g. $A,B$, which can only take the values $0$ or $1$. Operators are $\land$ (conjunction), $\lor$ (disjunction) and $\lnot$ (negation).

For Boolean logic use the tag .

3083 questions
0
votes
1 answer

How to create an AND , OR , XOR and NOT gates with a fredkin gate?

Ok so I am studying for an exam which is about logic gates and circuits , etc .The problem I have is with these two questions that are in the picture , it says build an AND , OR and NOT gate using logics 0 ,1 and one fredkin gate and then after…
alphagamma
  • 15
0
votes
2 answers

Problem simplifying equation using boolean algebra

I have this boolean equation: A'.B'.C'.D' + A'.B.C'.D' + B'.C'.D + B.C'.D Using a Karnaugh map I find I can simplify the above to: C'.(A' + D) I have used Wolfram Alfa website to confirm this simplification is correct. I would like to try…
brian
  • 3
0
votes
1 answer

Why does the number of 1s in a prime implicant set in a Karnaugh Map need to be a power of 2?

Pretty much the title. We were learning about Karnaugh maps in class today and they didn't really mention why it has to be a power of 2. A quick google search basically confirmed that it needs to be a power of 2 but I couldn't find the reason why…
Tejas Sharma
  • 101
0
votes
2 answers

Simplifying a Boolean expression for two-level NAND gate circuits

The expression is: F = (X' + Y' + Z')(Y' + A') I have no clear idea on how to go about simplifying this with Boolean algebra. After it's simplified, I'll need to implement it only using NAND gates. My instinct is to start off with using the…
borderlineNovice
  • 247
0
votes
1 answer

boolean algebra simplification solving

Can anyone help me out on this boolean algebra simplification...im not sure with my answer. X’YZ + XY’Z’ + X’Y’Z’ + XY’Z + XYZ my answer is x'yz+y'z'+xz but badly not sure of it! can you check thnks in advance I am assuming the "()" with "'" means…
joash
  • 1
0
votes
1 answer

Boolean Simplification questions

I'm having some trouble getting a handle with this course. We are starting Boolean algebra and my professor wants us simplify the following: Im sorry for the ignorance but I can't find a good reference to solve the…
joash
  • 1
0
votes
1 answer

Simplify Boolean Expression

so I have this expression and I have to simplify it to minimum SoPs $(x+(y'(z+w)')')'$ so my final answer is $x'y'z'w'$ but I think there is something wrong or trick can some one help me or tell me if my answer is right or wrong . thank you
D.k
  • 1
0
votes
1 answer

Is D646 a Boolean Algebra?

I read here: https://mathoverflow.net/questions/193924/how-to-recognize-if-a-lattice-is-distributive?newreg=1439abdc43e24ebcb32afa0532b74ecb that N5 and M3 lattices are not distributive. So I concluded that these lattices are not Boolean Lattices…
AmN
  • 113
0
votes
2 answers

Finding minterms from a boolean expression

I have a question regarding the process of finding minterms. Problem: Find the minterms of the following expression by first plotting each expression on a K-map: a) F(X,Y,Z) = XY + XZ + X’YZ b) F(W,X,Y,Z) = XZ + W’XY’ + WXY + W’YZ + WY’Z c)…
CapturedTree
  • 173
0
votes
1 answer

Simplify Boolean Expession

Can anyone verify this. If I can wrong can you point me in the correction direction: $$AB'C'+A'B'C+A'BC'+AB'C = B'(AC'+A'C+AC)+A'BC' \rightarrow B'(AC'+C)+A'BC' \rightarrow B'(C+A)+A'BC'\rightarrow $B'C+B'A+A'BC'$$ (Is this correct or is it…
learnmore
  • 173
0
votes
1 answer

CNF form in Boolean algebra

I have problems with CNF form of formula in boolean logic. I need to get it using only laws of boolean algebra. The formula is: $$(!a \land !b \land !c) \lor (!a \land !b \land d) \lor (b \land c \land !d) \lor (a \land c \land !d)$$ Thank you for…
Peter L
  • 1
0
votes
1 answer

Boolean algebra simplifcation

((q IMPLIES p) OR ((r OR q) AND (NOT q OR p) )) AND ((NOT p AND q) IMPLIES r) how do I simplify this to (p or not q) I'm stumped I have tried applying rules of interference but I just cant get it a simplified form much help will be appreciated…
abdul jefrre
  • 11
0
votes
1 answer

Coming up with an expression given the truth table

I have been given a truth table. I want find a boolean expression for it. However , I am not able to come up with one. Is there a specific way to go about , in order to get it done ? Also, Can this solution be possible using a single ssi 7400 chip…
harveyslash
  • 153
0
votes
2 answers

question about the notation in boolean algebra?

Is there a difference between $\bar{A}\bar{B}$ $\overline{AB}$ Is there a difference between $\bar{A}+\bar{B}$ $\overline{A+B}$ Also, just to be sure, the equal sign is a normal equal sign in boolean algebra right? So the left and right can be…
leftandright
  • 5
0
votes
3 answers

simplifying using Boolean Algebra.

I was doing the following question. Using the following rules of boolean algebra: _ law 1: X+X=1 law 2: X.1=X law 3:X.Y+X.Z = X.(Y+Z) simplify: __ _ __ ABC+ABC+ABC+ABC I have tried to simplify starting off with law 1, but I…
Xabi
  • 321
1 2 3
…
64 65