Optimal primitives on booleans

Primitives are listed under the first release where they are within a factor of two of optimal performance, that is, writing results as fast as the memory supports it.

15.0:
⊣ ⊢ + × ⌈ ⌊ |             ⊣ ⊢
~                         × ⌈ ⌊ | ∨ ∧ ⍱ ⍲ < ≤ = ≥ > ≠ ≡ ≢

16.0:
⌽ ⊖                       ⌽ ⊖   ⍪   ⌿ ⍀   ⊥ ⊤
                          / \  (with BMI2, introduced 2013)

17.0:
- ÷ * ⍟ ! ○ ⍕             + - ÷ * ⍟ !   ⌷

Room for improvement:
⍸ ⍉ ⌹                     ○ , ⍉ ⌹
⊖                         ⊖ ⌿ ⍀           (when ⊃⌽⍴⍵ is small)
⍒ ⍋ ∪                     ⍳ ~ ∪ ∩ ∊ ⍸ ⍷ ⍒ ⍋
  (monads)                   (dyads)