This text presents the formal concepts underlying Computer Science.

It starts with a wide introduction to Logic with an emphasis on reasoning and proof, with chapters on Program Verification and Prolog.

The treatment of computability with Automata and Formal Languages stands out in several ways:

• it emphasizes the algorithmic nature of the proofs and the reliance on simulations;
• it stresses the centrality of nondeterminism in generative models and the relationship to deterministic recognition models

The style is appropriate for both undergraduate and graduate classes.