Term and Credits
Fall 2026-2027
3 Credits
Room and Time
| Section | Days | Time | Room | Instructor | Course Assistant |
|---|---|---|---|---|---|
| 001 | MW | 10:30 am - 11:50 am | 3675 Market Street Room TBD | Mark Boady | Alvin Chen |
| 002 | MW | 12:00 pm - 1:20 pm | 3675 Market Street Room TBD | Mark Boady | Marius Garbea |
Instructors
Professor Mark Boady
Electronic Mail Address:
mwb33@drexel.edu
Office: 3675 Market Street
Office Hours: Monday/Wednesday 2-3PM and Thursday 2-4PM
Teaching Assistant(s)
All TA Office Hours are held in the CLC https://www.cs.drexel.edu/clc
| Name | Hours | |
|---|---|---|
| Veena Bontu | vb532@drexel.edu | Thursday 5:00-7:00PM in CLC (3675 Market Street 1066) |
| Alvin Chen | ac4525@drexel.edu | Friday 10:00-12:00PM in CLC (3675 Market Street 1066) |
| Marius Garbea | mag487@drexel.edu | Friday 12:00-2:00PM in CLC (3675 Market Street 1066) |
Course Description
Introduces formal logic and its connections to Computer Science. Students learn to translate statements about the behavior of computer programs into logical claims and to prove such assertions using both traditional techniques and automated tools. Considers approaches to proving termination, correctness, and safety for programs. Discusses propositional and predicate logic, logical inference, recursion and recursively defined sets, mathematical induction, and structural induction.
Course Objective and Goals
Topics
Audience and Purpose within Plan of Study
This is a required course for all Computer Science and Software Engineering students. It should also be of interest to Computer Engineering, Mathematics students and students with an interest in logic and computation.
Prerequisites
CS 172 Minimum Grade: D or CS 176 Minimum Grade: D or CS 265 Minimum Grade: D or SE 103 Minimum Grade: D or ECEC 301 Minimum Grade: D or ECEC 201 Minimum Grade: D
What Students Should Know Prior to this Course
What Students will be able to do upon Successfully Completing this Course:
Textbook
Professor Boady's Readings: https://logic.boady.net/README.html
Optional Resources:
Book of Proof (Second Edition)
Richard Hammack
Paperback: ISBN 978-0-9894721-0-4
Hardcover: ISBN 978-0-9894721-1-1
Available for Free online at: http://www.people.vcu.edu/~rhammack/BookOfProof/
The Racket Guide
Matthew Flatt, Robert Bruce Findler and PLT
https://docs.racket-lang.org/guide/index.html
Forall x: Calgary
P.D. Magnus and Tim Button
http://forallx.openlogicproject.org
If you want to learn more about functional programming.
The Little Schemer - 4th Edition
Daniel P. Friedman and Matthias Felleisen
ISBN-13: 978-0262560993
ISBN-10: 0262560992
Available at: Amazon
If you want to learn more about logic and proofs.
Connecting Discrete Mathematics and Computer Science - 2nd Edition
David Liben-Nowell
ISBN-13: 978-1009150491
Available at: Amazon
Grading and Policies
Final grades will be determined by your total points weighted according to this distribution. Grades may be curved but are generally computed via the formula below. It may be modified at the instructor's sole discretion, but letter grades will generally not be lower than those shown here.
Late Policy
Academic Honesty Policy
The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/current-students/undergraduate/policies/cs-academic-integrity/.
Academic Honesty Violations will be reported to the University. Punishment will be determined by the severity of the incident. Punishments include, but are not limited to,
Programming Language
Lectures
Labs
Homeworks
Exams
Extra Credit
PERMITTED USE OF ARTIFICIAL INTELLIGENCE TOOLS IN THIS COURSE: Artificial intelligence tools such as large language models (e.g., ChatGPT) are not permitted to be used in preparing submitted work for this course. Further information on university policies regarding the use of artificial intelligence tools in the classroom is available in the Draft Drexel University Policy on Academic Integrity Pertaining to Artificial Intelligence. Artificial intelligence tools may be used as study aids. They may be used to help prepare for tests, study material, or learn about topics. They may not be used to generate any code/answers that are submitted for credit.
University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:
CCI Culture and Community Statement
CCI's Commitment to Culture and Community The College of Computing and Informatics commits to creating a positive and safe learning environment for everyone - instructors, professional staff, and students - both inside and outside of the classroom. We embrace the wide range of thoughts, perspectives, and experiences that each community member brings, and we honor everyone's unique identity and lived experience. We encourage each community member to share information and feedback that will assist instructors and staff in fostering a supportive and inclusive community environment. For more information about CCI's commitment to culture and community, visit Culture & Community Council | Drexel CCI
Appropriate Use of Course Materials
It is important to recognize that some or all of the course materials provided to you are the intellectual property of Drexel University, the course instructor, or others. Use of this intellectual property is governed by Drexel University policies, including the IT-1 policy found at: https://drexel.edu/it/about/policies/policies/01-Acceptable-Use/ Briefly, this policy states that all course materials including recordings provided by the given prior written approval by the University. Doing so may be considered a breach of this policy and will be investigated and addressed as possible academic dishonesty, among other potential violations. Improper use of such materials may also constitute a violation of the University's Code of Conduct found at: https://drexel.edu/studentlife/community-standards/code-of-conduct and will be investigated as such.
Recording of Class Activities:
In general, students and others should not record course interactions and course activities in lecture, lab, studio or recitation.
Students who have an approved accommodation from the Office of Disability Resources to record online lectures and discussions for note taking purposes should inform their course instructor(s) of their approved accommodation in advance. The recording of lectures and discussions may only be carried out by the students enrolled in the class who have an approved accommodation from Disability Resources with their instructors' prior knowledge and consent. Students with approved accommodations may be asked to turn off their recorder if confidential or personal information is presented.
If a student has any comments, concerns, or questions about provided class materials and/ or recording, talk to your course instructor first. If this does not resolve the issue, you can also reach out to the Department Head, and use the process described for a grade appeal to move your concern forward. The process described for grade appeals can be found at: https://drexel.edu/provost/policies-calendars/policies/grade-appeals/
Please see the appropriate assignment webpages for a detailed description of course deliverables.
| Week | Topic | Assignments | |
|---|---|---|---|
| (1) 9/21/2026 |
Monday - No Class - Yom Kippur Lecture 1: Formal Logic |
Lab 1 - Due at end of Lecture 1 Homework 1 - Due 11:59PM Friday |
|
| (2) 9/28/2026 |
Lecture 2: Natural Deduction Basics Lecture 3: Disjunction Elimination |
Lab 2 - Due at end of Lecture 2 Lab 3 - Due at end of Lecture 3 Homework 2 - Due 11:59PM Friday |
|
| (3) 10/05/2026 |
Lecture 4: Proofs by Contradiction Lecture 5: Predicates and First Order Logic |
Lab 4 - Due at end of Lecture 4 Lab 5 - Due at end of Lecture 4 Homework 3 - Due 11:59PM Friday |
|
| (4) 10/12/2026 |
Monday - No Class - Indigenous People's Day Lecture 6: Deduction with Predicates (Video) Lecture 7: Introduction to Racket |
Lab 6 - Due Tuesday 10/13 at 11:59PM Lab 7 - Due at end of Lecture 7 Homework 4 - Due 11:59PM Friday |
|
| (5) 10/19/2026 |
Lecture 8: Recursion and Lists Lecture 9: Equational Reasoning |
Lab 8 - Due at end of Lecture 8 Lab 9 - Due at end of Lecture 9 Homework 5 - Due 11:59PM Friday |
|
| (6) 10/26/2026 |
Lecture 10: Midterm Review Midterm |
Lab 10 - Due at end of Lecture 10 Midterm - In Class During Second Lecture of Week |
|
| (7) 11/02/2026 |
Lecture 11: High Order Functions Lecture 12: Mathematical Induction |
Lab 10 - Due at end of Lecture 10 Lab 12 - Due at end of Lecture 12 Homework 6 - Due 11:59PM Friday |
|
| (8) 11/09/2026 |
Lecture 13: Peano Arithmetic Lecture 14: Induction on Lists |
Lab 13 - Due at end of Lecture 13 Lab 14 - Due at end of Lecture 14 Homework 7 - Due 11:59PM Friday |
|
| (9) 11/16/2026 |
Lecture 15: Lists as Trees Lecture 16: Boolean Normal Forms |
Lab 15 - Due at end of Lecture 15 Lab 16 - Due at end of Lecture 16 Homework 8 - Due 11:59PM Friday |
|
| (10) 11/23/2026 |
Lecture 17: Expressions as Trees Wednesday - No Class - Thanksgiving |
Lab 17 - Due at end of Lecture 17 | |
| (11) 11/30/2026 |
Lecture 18: SAT Solvers Lecture 19: NP-Complete Problems |
Lab 18 - Due at end of Lecture 18 Lab 19 - Due at end of Lecture 19 Homework 9 - Due 11:59PM Friday Extra Credit Course Survey - Due 11:59PM Friday |
|
| (Finals) 12/07/2026 | Final Exam TBD | ||