Robbins' theorem is a significant result in the field of Boolean algebra and combinatorial logic, primarily related to the minimization of Boolean functions. The theorem, formulated by Howard Robbins in 1937, states that any boolean function can be represented using a certain set of logical operations. Specifically, it provides a characterization of boolean functions that can be expressed using certain combinations of the logical operations AND, OR, and NOT.

Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version