|
15-317 Constructive Logic
|
Out | Assignment | Due | Solutions | |
---|---|---|---|---|
|
||||
Fri Sep 4 | Homework 1: Say Hi to Logic (PDF only) | Fri Sep 11 | sample solution | |
Fri Sep 11 | Homework 2: Tutch, Constructivity & Harmony! (PDF only) | Fri Sep 18 | sample solution | |
Fri Sep 18 | Homework 3: Proof Terms, Verification and Quantification (PDF only) | Fri Sep 25 | sample solution | |
Fri Sep 25 | Homework 4: Quantification and Arithmetic (PDF only) | Fri Oct 2 | sample solution | |
Fri Oct 2 | Homework 5: Sequent Calculus (PDF only) | Fri Oct 9 | sample solution | |
Fri Oct 9 | Homework 6: Admissibility and Derivability (PDF only) | Fri Oct 16 | sample solution | |
Fri Oct 16 | Homework 7: Classical Logic (PDF only) | Fri Oct 23 | sample solution | |
Fri Oct 23 | Homework 8: Computing proofs (PDF only) | Fri Oct 30 | ||
Fri Oct 30 | Homework 9: Proof search in G4ip (PDF only, helpful notes on g4ip) | Fri Nov 6 | ||
Fri Nov 6 | Homework 10: Practicing Prolog (PDF only) | Fri Nov 13 | ||
Fri Nov 20 | Homework 11: Linear Logic, Focusing, and Chaining (PDF only) | Fri Dec 4 | sample solution | |
Fri Dec 4 | Homework 12: Ordered and Modal Logic (PDF only) | Fri Dec 11 | 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
[ Home | Schedule | Assignments | Software ]
acowan@cmu
Avery Cowan