We provide a syntactic characterization of
Nondeducibility on Strategies in CTL$^*$ with knowledge and past time
operators, based on prior work by Halpern and O'Neill.
Our characterization is provided by means of a number of axioms that have to be satisfied by formulas specifying sets of strategies.
In Proceedings of WITS 2007.
gzipped postscript file.