No, it does not, and necessarily so :) The reasoning for this comes from computability theory: the class $MIP^*$ is contained in $RE$, which is known not to contain $coRE$ (the class for which determining which Turing machines do not halt is complete for).

Beautiful -- this is a lot more understandable to me than "modal logic" (what shows up on Lob's theorem's Wiki page).

I think Joel's was the first so I will accept that, but I wish I could accept both answers!