15-317 Constructive Logic
|Sep 4||Assignment 1: Natural Deduction (Tutch requirements, Tex, proof.sty)||Thu Sep 11||Solution Written, Solution Tutch|
|Sep 11||Assignment 2: Proof Terms (Tutch requirements, Tex, proof.sty)||Thu Sep 18||Solution Written, Solution Tutch|
|Sep 18||Assignment 3: Quantifiers (Tutch requirements, Tex, proof.sty)||Thu Sep 25||Solution Tutch|
|Sep 25||Assignment 4: Classical Logic (Tex)||Thu Oct 2||Solution Written, Solution Tutch|
|Oct 9||Assignment 5: Arithmetic (Tutch starter file,Tex)||Thu Oct 16||Solution Written Solution Tutch|
|Oct 16||Assignment 6: Prolog||Thu Oct 23||Solution|
|Oct 23||Assignment 7: Theorem Proving (Prolog starter file,Tex)||Thu Oct 30||Solution|
|Oct 30||Assignment 8: Cut and Meta-Interpreters (Tex)||Tues Nov 11||Solution|
|Nov 16||Assignment 9: Saturating Logic Programming (IRIS Problem 1, Problem 2, Problem 3)||Tues Nov 25||Sol 1, Sol 2, Sol 3|
|Nov 29||Assignment 10: Linear Logic (Exercises 12.2 and 12.3, Blocks World, Starter Code)||Fri Dec 5||Solution Written, Solution Sym|
All assignments in this course are individual assignments. The work must be your own. Do not copy any parts of the solution from anyone, and do not look at other students solutions. Do not make any parts of your solutions available to anyone and make sure noone else can read your files. We will rigorously apply the university policy on cheating and plagiarism.
We may modify this policy on some specific assignments. If so, it will be clearly stated in the assignment.
It is always permissible to clarify vague points in assignments, discuss course material from notes or lectures, and to give help or receive help in using the course software such as proof checkers, compilers, or model checkers.