Term and Credits
Spring 20202021
3 Credits
Room and Time
Section  Days  Room  Instructor 

001  TR  Online Only  Mark Boady 
002  TR  Online Only  Mark Boady 
004  TR  Online Only  Mark Boady 
Instructors
Professor Mark Boady
Electronic Mail Address:
mwb33@drexel.edu
Office: 3675 Market Street Room 1058 (near snack machine)
Extention: 2158952347 [Not Available During COVID]
Office Hours:
Tuesday 11AM1PM,
Thursday 3PM5PM
Teaching Assistant(s)
Tyler Le
Electronic Mail Address:
tml95@drexel.edu
Office: Live In Our Slack Space
Office Hours:
Monday 6PM8PM and 24PM
CLC Information:
https://www.cs.drexel.edu/clc
Akshat Tiwari
Electronic Mail Address:
]
at3345@drexel.edu
Office: Live In Slack Space
Office Hours:
Tuesday 68PM, Thursday 68PM
CLC Information:
https://www.cs.drexel.edu/clc
Lia Fredericks
Electronic Mail Address:
laf335@drexel.edu
Office: Live In Slack Space
Office Hours:
Wednesday 68PM, Friday 68PM
CLC Information:
https://www.cs.drexel.edu/clc
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
We will use free resources for this class.
Book of Proof (Second Edition)
Richard Hammack
Paperback: ISBN 9780989472104
Hardcover: ISBN 9780989472111
Available for Free online at:
http://www.people.vcu.edu/~rhammack/BookOfProof/
The Racket Guide
Matthew Flatt, Robert Bruce Findler and PLT
https://docs.racketlang.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
ISBN13: 9780262560993
ISBN10: 0262560992
Available at:
Amazon
If you want to learn more about recursive proofs.
The Little Prover  1st Edition
Daniel P. Friedman and Carl Eastlund
ISBN13: 9780262527958
ISBN10: 0262527952
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/currentstudents/undergraduate/policies/csacademicintegrity/.
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
Blogs
Exams
Slack Channel
Computer/Software Help
iCommons: http://drexel.edu/cci/about/ourfacilities/rushbuilding/iCommons/
University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:
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 IT1 policy found at: https://drexel.edu/it/about/policies/policies/01AcceptableUse/
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/cpo/policies/cpo1/ 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/gradeappeals/
Please see the appropriate assignment webpages for a detailed description of course deliverables.
Online Deadlines To allow for students in a variety of time zones, assignments will be accepted till 8AM the following day with no penalty.
Week  Topic  Homework  

(1) March 29, 2021 
Lecture 1: Boolean Logic Lecture 2: Natural Deduction (Part 1) 
Lab 1  Due 8AM SAT Blog 1  Due 8AM SAT 

(2) April 5, 2021 
Lecture 3: Natural Deduction (Part 2) Lecture 4: Natural Deduction (Part 3) 
Homework 1  Due 8AM THURS Lab 2  Due 8AM SAT Blog 2  Due 8AM SAT 

(3) April 12, 2021 
Lecture 5: Predicates and First Order Logic Lecture 6: Deduction with Predicates 
Homework 2  Due 8AM THURS Lab 3  Due 8AM SAT Blog 3  Due 8AM SAT 

(4) April 19, 2021 
Lecture 7: Introduction to Racket Lecture 8: Recursion and Lists 
Homework 3  Due 8AM THURS Lab 4  Due 8AM SAT Blog 4  Due 8AM SAT 

(5) April 26, 2021 
Lecture 9: Mathematical Induction Lecture 10: Induction on Lists 
Homework 4  Due 8AM THURS Lab 5  Due 8AM SAT Blog 5  Due 8AM SAT 

(6) May 3, 2021 
Midterm Exam 
Midterm Thursday 

(7) May 10, 2021 
Lecture 11: High Order Functions Lecture 12: Induction and High Order Functions 
Homework 5  Due 8AM THURS Lab 6  Due 8AM SAT Blog 6  Due 8AM SAT 

(8) May 17, 2021 
Lecture 13: Peano Arithmetic Lecture 14: Boolean Expressions as Lists 
Homework 6  Due 8AM THURS Lab 7  Due 8AM SAT Blog 7  Due 8AM SAT 

(9) May 24, 2021 
Lecture 15: Boolean Normal Forms Lecture 16: Simplifying Expressions Recursively 
Homework 7  Due 8AM THURS Lab 8  Due 8AM SAT Blog 8  Due 8AM SAT 

(10) May 31, 2021 Memorial Day 
Lecture 17: SAT Solvers Lecture 18: NPComplete Problems 
Homework 8  Due 8AM THURS Lab 9  Due 8AM SAT Blog 9  Due 8AM SAT 

(12) June 7, 2021 
Final Exam  Online TBD 