I want to know what textbooks you would recommend to prepare for a very challenging course on computational theory that I'll be taking in the fall. Brief description: The rigorous application of logic and proof techniques to Computer Science. Propositional and predicate logic; mathematical induction and other basic proof techniques; correctness proofs for iterative and recursive algorithms; recurrence equations and their solutions (including the “Master Theorem”); introduction to automata and formal languages. I don't really have a strong background into computational theory. I'm only familiar with very basic complexity theory. But the course doesn't require any added prerequisites. Its just an accelerated introduction.