1
vote
1answer
38 views

Why exactly are NAND and NOR the only universal binary logic functions?

We know there are 16 possible binary logic functions: ...
2
votes
1answer
41 views

Computation and Elimination (Solution Verification)

Consider a set B (of binary strings) given by the introduction rules: \begin{equation} \frac{}{\epsilon :B} \quad \frac{a:B}{s_{0}(a):B} \quad \frac{a:B}{s_{1}(a):B}\end{equation} ...
0
votes
1answer
352 views

The input represent a 4-bit unsigned binary number, the output W, is 1 if the number is multiple of 2 or 3 but not both.

I completely understand how to make a truth table and the entire concept of boolean algebra. However, I am confused how to make the truth table for the above information. Because the input is a 4-bit ...
2
votes
2answers
230 views

multiple xor (sum of parities)

If we have: $b_1 \oplus b_2 = b_1 (1 - b_2) + b_2 (1 - b_1)$ what is (or are, if there are different versions) the compact general formula for a multiple "summation": $b_1 \oplus b_2 \oplus \dotsb ...
10
votes
1answer
437 views

Finding Expressively Adequate truth Functions

I was wondering if someone could help me count the total number of Truth Functions of 3 variables, that can generate all the possible truth functions.. I got 56 but I'm not sure of the answer. EDIT: ...