Abstract: Sieber has described a model of PCF consisting of continuous functions that are invariant under certain (finitary) logical relations, and shown that it is fully abstract up to rank three types. We show that one may achieve full abstraction at all types using a form of ``Kripke logical relations'' introduced by Jung and Tiuryn to characterize lambda-definability.