Logical nonlocality is completely characterized by Hardy's “paradox” in (2,2,l) and (2,k,2) scenarios. We consider a variety of consequences and applications of this fact. (i) Polynomial algorithms may be given for deciding logical nonlocality in these scenarios. (ii) Bell states are the only entangled two-qubit states which are not logically nonlocal under projective measurements. (iii) It is possible to witness Hardy nonlocality with certainty in a simple tripartite quantum system. (iv) Noncommutativity of observables is necessary and sufficient for enabling logical nonlocality.