1
vote
1answer
32 views

AND using XOR and OR?

Is there a way to make an AND using only XOR and OR. I know that a XOR b = ab'+ba' but I have no idea how to proceed. Could it be impossible?
1
vote
1answer
55 views

Semantic consequence

I'm studying refutation trees in computer science II, but I have a big doubt: Let $\Gamma, \Psi \subseteq F_m$ Is the following hypothesis true? $\Gamma \vDash \Psi \iff \not\vDash\{\Gamma,\lnot ...
0
votes
0answers
81 views

Boolean algebra - cube - minimal disjunctive normal form

I have a test coming up and I would like to know how to solve these kinds of problems. This is the description: ...
0
votes
1answer
69 views

Checking Boolean Algebra work - Simplification

I am currently working on an assignment for a CE class I am taking, and I wanted to know if I have been simplifying these equations correctly. I'm supposed to reduce them to a sum of products. 1) ...
0
votes
2answers
777 views

problem simplifying boolean algebra expression using consensus theorem

Please simplify this logic expression for me with helping boolean algebra : A'C'D + A'BD + BCD + ABC + ACD' I know that must use consensus theorem . my solve : STEP 1 : Terms 1 & 3 ...
1
vote
0answers
34 views

simplifying boolean algebra expression [duplicate]

A very urgent question : Please simplify this logic expression for me with helping boolean algebra : A'C'D + A'BD + BCD + ABC + ACD' I know that must use consensus theorem . my solve : STEP 1 : ...
0
votes
0answers
30 views

What is the simplest form of the Boolean expression below? [duplicate]

I'm completely new to Boolean algebra, and I'm trying to simplify the expression below, using the distributive law, cancellation, negative absorption and De Morgan's theorem. I would start with the ...
2
votes
2answers
93 views

Boolean Algebra-Simplification Assistance Needed

I have to show that (!(P.Q) + R)(!Q + P.!R) => !Q by simplifying it using De Morgan's Laws. Here is what I did but I'm not sure it's right. (!(P.Q) + R)(!Q + P.!R) => !Q (!P + !Q + R)(!Q + P.!R) ...
0
votes
1answer
84 views

Is it properly applied the Quine McCluskey algorithm by this?

I'm writing some code for implementing the Quine McCluskey algorithm and I simply need to clear out if my logic for implementation is ok. I get some number of minterms and combine each of them so ...
2
votes
2answers
32 views

Get A⊕(B+1) from A⊕B

I have numbers A,B,C.D. (⊕ is XOR) C = A⊕B D = A⊕(B+1) Is there any way to get D from C, when I do not know A and B? How? Thanks for help!
2
votes
2answers
44 views

finding signs of 3 numbers

This is slightly more of a coding problem than a math problem but I think it is still relevant. So let's say I have 3 numbers A,B,C and I can only call a given function if two are negative and one ...
0
votes
1answer
109 views

Help with simplifying boolean functions algebraically

I have 2 boolean functions that I am having some difficulty solving algebraically. NOTE: ~ means NOT, & means AND, + means OR 1) $(\sim b~\&~\sim d)+(b~\&~\sim ...
1
vote
0answers
90 views

Question regarding implicant chart of Quine-McCluskey algorithm

In https://en.wikipedia.org/wiki/Quine-McCluskey#Example, at the end of Step 1, there is a table that shows the number of 1's, minterms, 0-cube and size-2 implicants and size-4 implicants. But I am ...
0
votes
1answer
99 views

Proving if equations are products of XOR

I have to prove analytically to see if these equations are exclusively or. $$A⊕ A=0$$ Do I solve this by using the truth table? ...
0
votes
1answer
191 views

Boolean simplification

So I am giving this expression D +B’C’ + CD’ +A B’C and I ask to simplify it When working through it I get D+B'C'+CD'+AB'C D'(A'B'+CD'+AB) D'(A'B'+A(B'+B)) D'(A'B'+AC') D'(B'+A) Am I on the right ...
0
votes
1answer
68 views

Boolean Function

A Boolean expression is given: (A B)’ + B C’ +A’ C = F. Construct the logical circuit and draw the timing diagram of the output F. I am not sure where to start.
1
vote
2answers
621 views

Stuck on rewriting logical implication

I've started to work through Applied Mathematics for Database Professionals and have been stuck on one of the exercises for two days. I've been able to prove the expression: $$\left( P\Rightarrow Q ...
0
votes
2answers
199 views

Can Boolean function's value be computed by using a rewrite system?

Suppose there is a function in e.g. CNF form. For example: $$ (A \vee B) \wedge (\neg B \vee C \vee \neg D) \wedge (D \vee \neg E) $$ For given A,B,C,D,E values it is possible to compute the value ...
1
vote
1answer
1k views

Parity Checking and truth tables

I have a question that I am very confused about. Parity Checking. Produce a truth table for a parity checking circuit that is based on $4$ input data bits, an input parity bit and a single ...