15-317 Constructive Logic
|Fri Aug 31||Homework 1: Say Hi to Logic (PDF only)||Fri Sep 7||sample solution|
|Fri Sep 7||Homework 2: Tutch, Constructivity & Harmony! (PDF only)||Fri Sep 14||sample solution|
|Fri Sep 14||Homework 3: Proof Terms, Verification and Quantification (PDF only)||Fri Sep 21||sample solution|
|Fri Sep 28||Homework 4: Sequent Calculus (PDF only)||Fri Oct 5||sample solution|
|Fri Oct 5||Homework 5: Admissibility and Derivability (PDF only)||Fri Oct 12||sample solution|
|Fri Oct 12||Homework 6: Computing Proofs (PDF only)||Fri Oct 19||sample solution|
|Fri Oct 19||Homework 7: Proof search in G4ip (PDF only)||Fri Oct 26||sample solution|
|Fri Oct 26||Homework 8: Practicing Prolog (PDF only)||Fri Nov 2||sample solution|
|Fri Nov 2||Homework 9: Focusing and Classical Logic (PDF only)||Fri Nov 16||sample solution|
|Fri Nov 16||Homework 10: Linear Logic (PDF only)||Mon Nov 26||sample solution|
|Fri Nov 30||Homework 11: Ordered and Modal Logic (PDF only)||Fri Dec 7||sample solution|
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 no one else can read your files. We will rigorously apply the university policy on academic integrity 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 or compilers