Although the fields of logic and computation are intrinsically related, most courses treat the two topics separately. This unique textbook aims to compress and unify important concepts of logical reasoning and computational theory, facilitating an in-depth understanding. Delivering theory with practical approaches, the book features early chapters accompanied by exercises in Isabelle/HOL, a popular and user-friendly theorem prover. Latter chapters address modelling and verification in Process Analysis Toolkit (PAT), a feature-rich model checker based on Hoare's Communicating Sequential Processes. The exposition focuses on the syntax, semantics and proof theory of various logics, as well as on automata theory, formal languages, computability, and complexity. It also builds a hybrid skill set of practical theorem proving and model checking, which will provide a solid grounding for future research or work involving formal methods. Topics and features: Offers a transition from logic to computation via linear temporal logic and state machines Includes exercises from widely-used software applications Provides entry-level tutorials for Isabelle/HOL and PAT Employs many examples from the Archives of Formal Proofs, as well as many examples of PAT models Introduces classical and nonclassical logics in an integrated presentation Discusses lambda calculus, recursive functions and Turing machines Concludes by addressing the Curry-Howard correspondence, which unifies logic and computation The work is optimal for undergraduate students striving for a degree in computer science. In addition, it will be an excellent foundational volume for research students considering higher-degree research programs. Zhe Hou is a lecturer in the School of Information and Communication Technology at Griffith University, Nathan, Australia. His research pursuits include explainable AI, autonomous systems, formal verification, and automated reasoning.