  The paper presents an extension of temporal epistemic logic with operators
that quantify over strategies. The language also provides a natural way to
represent what agents would know were they to be aware of the strategies being
used by other agents. Some examples are presented to motivate the framework,
and relationships to several variants of alternating temporal epistemic logic
are discussed. The computational complexity of model checking the logic is also
characterized.
