|
15-317 Constructive Logic
|
Out | Assignment | Due | Solutions | |
---|---|---|---|---|
|
||||
Wed Aug 30 | Homework 0: Say Hi to Logic (PDF only) | Thu Sep 7 | sample solution | |
Tue Sep 5 | Homework 1: Natural Deduction and Constructivity (PDF only) | Tue Sep 12 | sample solution Tutch | |
Tue Sep 12 | Homework 2: Proof Terms and Harmony (PDF only) | Tue Sep 19 | sample solution Tutch | |
Tue Sep 19 | Homework 3: Verification and Quantification (PDF only) | Tue Sep 26 | sample solution Tutch | |
Tue Oct 3 | Homework 4: Sequent Calculus (PDF only) | Tue Oct 10 | sample solution | |
Tue Oct 10 | Homework 5: Computing Proofs (PDF only) | Thu Oct 19 | (no sample solution) | |
Thu Oct 19 | Homework 6: Proof Checking and Certification (PDF only) | Thu Oct 26 | (no sample solution) | |
Tue Oct 24 | Homework 7: Practising Prolog (PDF only) | Thu Nov 2 | sample solution | |
Tue Oct 31 | Homework 8: Focusing and Chaining (PDF only) | Tue Nov 14 | sample solution | |
Tue Nov 14 | Homework 9: Substructural Logic (PDF only) | Tue Nov 21 | sample solution | |
Tue Nov 28 | Homework 10: Ordered and Subsingleton Logic (PDF only) | Tue Dec 5 | 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 noone 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
[ Home | Schedule | Assignments | Software ]
fp@cs
Frank Pfenning