This paper considers the relation between complete inflation and perfect recall of information partitions in extensive games. It is proved that an information partition with perfect recall is completely inflated. This result, combined with Dalkey's theorem, shows that in the class of games (without chance moves) with perfect recall, a game is determinate if and only if every player has perfect information. A necessary and sufficient condition is provided for information partitions whose complete inflations have perfect recall.