CS 270 Mathematical Foundations in CS - Syllabus

Term and Credits

Summer 2017-2018
3 Credits

Room and Time

Tuesday/Thursday 3:30pm-4:50pm University Crossings Room 149


Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 215-895-2347
Office Hours: Monday 4-5PM, Tuesday 12-1PM, Thursday 12-1PM

Teaching Assistant(s)

Alexander Duff
Electronic Mail Address: amd435@drexel.edu
Office: Drexel CLC UC 152
Office Hours:Monday 2-4PM, Wednesday 2-4PM

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

  1. To use recursion and divide and conquer to solve problems
  2. To provide recursive definitions of patterns and data structures
  3. To formally specify the input/output requirements of programs
  4. To use induction and other proof techniques to prove properties of algorithms, data structures, programs, and computer systems
  5. To use logic to describe the state of systems and to use logical deduction (by hand and using tools) to prove properties of systems
  6. To understand the power and limitations of formal logic.

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.

Students should have programming experience (CS172 or equivalent).

What Students Should Know Prior to this Course

  1. Ability to read and understand code.
  2. Basic understanding of program execution.
  3. Ability to write simple recursive programs.

What Students will be able to do upon Successfully Completing this Course:

  1. Use Proofs by Deduction to Justify Logical Statements
  2. Be able to write and analyze Recursive Functions
  3. Be able to implement and use a SAT solver.
  4. Use Inductive Proofs to Justify the correctness of programs and statements.
  5. Use logic to describe the state of systems.


We will use free resources for this class.

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

Course Material

Programming Language





Slack Channel

Special Circumstances

Course Policies

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,

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.

Computer/Software Help
iCommons: http://drexel.edu/cci/about/our-facilities/rush-building/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:


  1. Functional Programming
  2. Recursion, Recursive Definitions and Induction
  3. Propositional and Predicate Logic
  4. Formal Proof using Natural Deduction
  5. Applications of Logic to Computer Science
  6. Divide and Conquer Algorithms and Recurrence Relations
  7. Program Specification and Verification
  8. Automated Reasoning
  9. Termination Analysis
  10. Test Case and Counter Example Generation

Tentative Course Schedule

Please see the appropriate assignment webpages for a detailed description of course deliverables.

Week Topic Reading Homework
1 (6/25/18) Introduction to Racket Quick: An Introduction to Racket with Pictures
So You Want to be a Functional Programmer (Part 1)
Homework 1 - Due 7/4/18 at 11:59PM
2 (7/2/18) List Processing List, Iteration, and Recursion
High-order list operations (Ignore Haskell Part)
Homework 2 - Due 7/11/18 at 11:59PM
3 (7/9/18) Natural Numbers Peano Axioms Homework 3 - Due 7/18/18 at 11:59PM
4 (7/16/18) Propositional Logic: Boolean Functions and Expressions Chapter 2 from Book fo Proof Homework 4 - Due 8/1/18 at 11:59PM
5 (7/23/18) SAT Solvers MiniSat in Browser
Boolean Satisfiability Problems
HW4 Extended to 8/1/18 at 11:59PM
6 (7/30/18) Tuesday - Midterm Review
Thursday - Midterm in Class
7 (8/6/18) Natural Deduction Chapter 4 from Book of Proof
Deduction Proof Checker
Pages 142 to 164 of Symbolic Logic: A First Course
Homework 5 - Due 8/15/18 at 11:59PM
8 (8/13/18) Proofs by Contradiction Chapter 6 from Book of Proof
Deduction Proof Checker
Pages 164 to 183 of Symbolic Logic: A First Course
Homework 6 - Due 8/22/18 at 11:59PM
9 (8/20/18) Mathematical Induction Chapter 10 from Book of Proof
Homework 7 - Due 8/29/18 at 11:59PM
10 (8/27/18) Structural Induction   Homework 8 - Due 9/5/18 at 11:59PM
11 (9/3/18) Final Exam - Time and Location TBD