Versions of the standard logical operations that operate on single bits.
We provide versions of the non-trivial standard logical operations
that operate on single bits.
One reason that it is useful to introduce these operations separately from
the standard operations is the fact that lognot applied to a bitp
object never returns a bitp.
All arguments to these functions must be bitp, and we prove that
each returns a bitp integer, i.e., 0 or 1. We define each function
explicitly in terms of 0 and 1 to simplify reasoning.
- Rewrite: Simplification rules for all binary b- functions
including commutative rules, reductions with 1 explicit value, and reductions
for identical agruments and complemented arguments.
- Equivalence (a.k.a. if and only if, xnor) for bitps.
- Inclusive or of bitps, complementing the second.
- Inclusive or of bitps, complementing the first.
- Negated or for bitps.
- Negated and for bitps.
- If-then-else for bitps.
- Inclusive or for bitps.
- And of bitps, complementing the second.
- And of bitps, complementing the first.
- Conjunction for bitps.
- Exclusive or for bitps.
- Negation for bitps.