Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with boolean-algebra
Search options not deleted
user 18033
In mathematics and mathematical logic, boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0 respectively. Boolean algebra is used in the analysis and simplification of digital (logic) circuits
1
vote
Accepted
Boolean algebra - dual and self dual functions
Functions \$f\$ and \$f_d\$ are duals if
$$f(A,B,..) = \overline{f_d(\overline{A},\overline{B},..)}$$
or in other words if you invert all the inputs of a dual function (relative to the other dual), …
- 1,770
0
votes
Convert this to standard POS
I am not sure what you mean by "standard POS" but I have assumed you mean "reduced standard boolean form".If that is the case then the following applies
let
$$
f = A( A + \bar{C} ) ( A + B)
$$
then b …
- 1,770
1
vote
Build AND logic gate with 74'00 ICs (NAND) in negative logic
I am not sure I fully understand your question but you can easily build a AND gate by using 2 NAND gates, this can be shown as follows:
$$
f(A,B) = AB = \overline{\overline{AB}} = \overline{\overline …
- 1,770