Order, lattices, ordered algebraic structures Concept
Boolean function
Summary
A Boolean function is a function from -tuples of bits to bits. Boolean functions are the objects that logic formulas and digital circuits compute. The node Boolean function gives the precise definition.
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Boolean_function, lead section
About this page
| Tag | 0X05GS525E |
|---|---|
| URI | m2://0X05GS525E |
| Kind | concept |
| Writing | W1 stated |
| MSC | 06E30, 94C11 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.