CS 3234 - Logic and Formal Systems
[Semester I, 2003-2004] [Instructor Stefanescu, Gheorghe]

[ News | Course info | Lecture | Tutorial | Assig/Test | References | Contact | Misc ]


..Hot..News..

Partial CA results (14) (final) Tutorial subgroups
lectures: [1][2][3] [4][5][6] [7][8][9] [10][11][12] [1][2][3] [4][5][6] [7][8][9] [10][11] :tutorials

Topics, course material & schedule

Lec.DateTopics Lecture notesReading material, additional references
Lec.1 14/08/03 Propositional logic 1 [natural deduction] [pdf] [ps] [(4/1)ps] Textbook, Ch1:1-34
Lec.221/08/03 Propositional logic 2 [syntax, semantics, soundness & completness] [pdf] [ps] [(4/1)ps] Textbook, Ch1:38-69
Lec.328/08/03 Propositional logic 3 [normal forms + complements] [pdf] [ps] [(4/1)ps] Textbook, Ch1:69-89; Takeuki Ch1:5-20; Girard'87
Lec.44/9/03 Predicate logics 1 [syntax, natural deduction] [pdf] [ps] [(4/1)ps] Textbook, Ch2:90-120
Lec.511/9/03 Predicate logics 2 [proof theory, semantics, undecidability of validity] [pdf] [ps] [(4/1)ps] Textbook, Ch2:120-147
Lec.618/9/03 Predicate logics 3 [normal forms, resolution, logic programming] [pdf] [ps] [(4/1)ps] Ben-Ari, 64-77; 130-141; 148-166
-25/9/03 Mid-Term Test (MCQ, Lec. 1 to 6)- Lec. 1 to 6
Lec.72/10/03 Model checking 1 [syntax, semantics, examples] [pdf] [ps] [(4/1)ps] Textbook, Ch3:148-172
Lec.89/10/03 Model checking 2 [model checking algorithm; SMV] [pdf] [ps] [(4/1)ps] Textbook, Ch3:172-193
Lec.916/10/03 Model checking 3 [examples, correctness, and extensions] [pdf] [ps] [(4/1)ps] Textbook, Ch3:193-215
Lec.1023/10/03 Program verification: Floyd-Hoare logic 1 [pdf] [ps] [(4/1)ps] Manna, Ch4:160-220 + Textbook, Ch4:216-230
Lec.1130/10/03 Program verification: Floyd-Hoare logic 2 [pdf] [ps] [(4/1)ps] Textbook, Ch4:230-260
Lec.126/11/03 Predicate logics 4 [soundness & completeness; Goedel incompleteness theorem] [pdf] [ps] [(4/1)ps] Hamilton, 89-96; 124-151

Tutorials

TutorialDateQuestions Solution
Tut.125-31 August [pdf][ps] IVLE
Tut.21-7 September [pdf][ps] IVLE
Tut.38-14 September [pdf][ps] IVLE
Tut.415-21 September [pdf][ps] IVLE
Tut.522-28 September [pdf][ps] IVLE
Tut.629 September - 5 October [pdf][ps] IVLE
Tut.76-12 October [pdf][ps] IVLE
Tut.813-19 October [pdf][ps] IVLE
Tut.920-26 October [pdf][ps] IVLE
Tut.1027 October - 2 November [pdf][ps] IVLE
Tut.113-9 November [pdf][ps] IVLE

Assignments

AssignmentQuestionsSet on: Due to:
Ass.1[lec.1-4] [pdf][ps] 15-sept-0322-sept-03, 1pm
Ass.2[lec.7-9] [pdf][ps] 21-oct-0328-oct-03, 2pm
Ass.3[lec.10-11] [pdf][ps] 1-nov-038-nov-03, 2pm

Mid-term Test

Venue/DateTopicsQuestions Answers
LT34, 25sept, 4-6pm[lec.1-6] [pdf][ps] [pdf][ps]

Course Information

Type
This is an elective module in the area A3.
Instructor
Gheorghe Stefanescu
Building S-16, Level 4, Room 16; Tel:+65-874-6613; Fax:+65-779-4580;
Email: gheorghe@comp.nus.edu.sg
Lectures
Thu 4-6pm LT34
Tutorials
SR4 (SoC-1, #06-??): Wed 10-11am(Gr1); Wed 11-12am(Gr2); Fri 2-3pm(Gr3); Fri 3-4pm(Gr3)
Consultations
Wed 9-10am; Wed 12am-1pm; Fri 1-2pm, Fri 4-5pm (or by appointment)
Exam
24 NOV 2003 Evening (Open Book)
Grading
40% Continuous Assessment:
10% assignments;
10% tutorials;
20% mid term test (Multiple Choice, Closed Book)
60% Final Exam
Course type
While most of the topics are part of classical mathematical logics, the examples are tailored for the computer science needs. Consequently, the course requires a combination of mathematical maturity and programming experience.
Prerequisites
Pass CS1231 or CS1231S or MA1100;
Programming experience is preferred.
Brief Description
The course aims to cover both classical and non-classical logics focusing on their deductive and algorithmic aspects. This module introduces mathematical logic as a means for specifying, verifying and reasoning about computer programs. Its emphasis, in contrast to other similar logic courses, is on how logic can be used to represent computational problems, how these representations can be proved correct and how they can be executed on a computer. Topics covered include classical logic theories, logic programming, modal logic, and an introduction to non-standard logics. Treatment of propositional calculus, predicate calculus, and temporal logic are fully covered with emphasis on their specification, verification, deductive and algorithmic aspects.

References

Textbook The course uses the (fully recommended) textbook
Logic in Computer Science: Modelling and reasoning about systems
by Michael Huth and Mark Ryan
387 pages, 2000; Cambridge University Press; ISBN: 0-521-65200-8
Additional references
Ben-Ari, M.: Mathematical Logic for Computer Science, Prentice Hall, 1993. [In: RBR Collection, NUS SC Library]
Hamilton, A.G.: Logic for Mathematicians, Cambridge University Press, 1978 [In: RBR Collection, NUS SC Library]
Kleene, S.C.: Introduction to Metamathematics, North-Holland, 1952.
Manna, Z.: Mathematical Theory of Computation, McGraw-Hill, 1974. [In: RBR Collection, NUS SC Library]
Takeuki, G.: Proof Theory, North-Holland, 1975.

..Old..News..


... older news

[ News | Course info | Lecture | Tutorial | Assig/Test | References | Contact | Misc ]

Maintained by Gheorghe Stefanescu