A two-way conditional in which each term is both sufficient and necessary for the other: P ↔ Q means both P → Q and Q → P. In natural language it appears as "P if and only if Q" or "either both P and Q, or neither." On the LSAT, biconditionals are powerful because triggering either side forces the other, and negating either side forces the negation of the other.