--- title: Logic in Computer Science description: This topic covers the application of mathematical logic to computer science, including propositional and predicate calculus. Learners will understand how to use formal logic for software verification, database queries, artificial intelligence reasoning, and hardware design. category: programming-tech subcategory: theoretical-computer-science difficulty: beginner, intermediate, advanced url: /subject/logic-in-computer-science --- # Logic in Computer Science This topic covers the application of mathematical logic to computer science, including propositional and predicate calculus. Learners will understand how to use formal logic for software verification, database queries, artificial intelligence reasoning, and hardware design. ## Available Resources 1 Videos • 2 Books • 3 Courses • 2 Websites ## Courses ### 1. Logic II (MIT 24.242) **Author:** Vann McGee Computability theory followed by a detailed study of Gödel's incompleteness theorems and their applications, including Church's undecidability theorem and Tarski's theorem on the undefinability of truth. Lecture notes and problem sets with solutions let learners work through these proofs themselves. **Difficulty:** Intermediate | **Price:** Free **Link:** https://ocw.mit.edu/courses/24-242-logic-ii-spring-2004/ **Tags:** incompleteness-theorems, computability, undecidability, tarski-undefinability, recursion-theory ### 2. Introduction to Logic This course is an introduction to Logic from a computational perspective. It shows how to encode information in the form of logical sentences; it shows how to reason with information in this form; and it provides an overview of logic technology and its applications - in mathematics, science, engineering, business, law, and so forth. **Difficulty:** Beginner | **Language:** English | **Duration:** 10 weeks of study, 4-8 hours/week | **Price:** Free **Link:** https://www.coursera.org/learn/logic-introduction **Tags:** courses, mathematics-statistics, discrete-math ### 3. Logic for Computer Science A Coursera course from BITS Pilani on computational logic: propositional and predicate logic, natural deduction, soundness and completeness, undecidability, LTL and CTL model checking, and Floyd-Hoare program verification. Learners can write formal proofs and verify properties of algorithms and systems. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://www.coursera.org/learn/bits-logic-for-computer-science **Tags:** propositional-logic, predicate-logic, model-checking, temporal-logic, hoare-logic, program-verification ## Videos ### 1. Combining Formal Methods and Machine Learning **Author:** Jane Hillston Recorded 2019 Wheeler Lecture at the Cambridge Computer Laboratory in which Edinburgh's Jane Hillston explains how stochastic process algebras and machine learning complement each other, presenting two projects that embed learning techniques into formal quantitative modelling of dynamic systems. **Difficulty:** Advanced | **Price:** Free **Link:** https://sms.cam.ac.uk/media/2994029 **Tags:** formal-methods, stochastic-process-algebra, quantitative-modelling, machine-learning, performance-modelling ## Books ### 1. Logic in Computer Science **Author:** Michael Huth, Mark Ryan University textbook on logic as a tool for specifying and verifying systems, covering propositional and predicate logic, temporal logics with model checking, program verification, and modal logic. Students learn to reason formally about software and hardware correctness. **Difficulty:** Intermediate | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/0521656028?tag=edmonddante07-20 **Tags:** books, technology-computer-science, theoretical-computer-science ### 2. Mathematical Logic for Computer Science **Author:** Mordechai Ben-Ari Textbook on propositional and first-order logic for computer scientists, emphasising automated proof methods such as semantic tableaux, resolution, and logic programming, plus program verification and temporal logic. Readers learn to build and check formal proofs algorithmically. **Difficulty:** Intermediate | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/1852333197?tag=edmonddante07-20 **Tags:** books, technology-computer-science, theoretical-computer-science ## Websites ### 1. logicmatters.net Logic Matters is a blog and resource site dedicated to mathematical logic. It provides expository notes, essays, and curated reading lists across topics such as model theory, proof theory, computability, and set theory, with materials for students and researchers. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://logicmatters.net **Tags:** websites, mathematics-statistics, mathematics ### 2. brilliant.org Brilliant.org is an online, interactive learning platform offering problem-based courses in math and computer science, including topics in automata theory, computation, and discrete mathematics, with guided lessons and practice problems. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://brilliant.org **Tags:** websites, technology-computer-science, theoretical-computer-science --- *This content is part of Dantes.io - Your Treasure Map to Knowledge* *Curated by humans at Dantes.io. Personal study use welcome; republishing this curation requires permission (team@dantes.io).* View this page online: https://dantes.io/subject/logic-in-computer-science