M. Math. / M.Tech.(CS)
ISI Kolkata, 2025-2026 Session
Semester: Even
Instructor: Sujata Ghosh
Meeting Times : Wednesdays, Fridays 9:15 - 11:00 am
First Class: Wednesday, January 07, 2026
Location: Online
Instructor: Sujata Ghosh
Meeting Times : Wednesdays, Fridays 9:15 - 11:00 am
First Class: Wednesday, January 07, 2026
Location: Online
[Teaching staff | Course overview | References | Grading | Lecture schedule | Homeworks/Handouts]
Teaching staff
Instructor
Sujata Ghosh
Email: sujata AT isichennai DOT res DOT in
Office Hours: By Arrangement (please send an e-mail)
Office Hours: By Arrangement (please send an e-mail)
TA
Saptarshi Sahoo
Email: saptarshi AT isichennai DOT res DOT in
Office Hours: By Arrangement (please send an e-mail)
Office Hours: By Arrangement (please send an e-mail)
Course overview
Course Description: This course can be considered as an introductory course on mathematical logic with theoretical
computer science in mind. We will deal with both model-theoretic and proof-theoretic techniques. We will
also give an introduction to logics of computation and connections with algorithms and complexity.
The complete syllabus of the course can be
found here.
This course is also about building up mathematical maturity, e.g., how to read and write mathematics, especially mathematical proofs, and how to communicate mathematics.
This course is also about building up mathematical maturity, e.g., how to read and write mathematics, especially mathematical proofs, and how to communicate mathematics.
Pre-requisites (for M.Tech. (CS) students): A course on Discrete Mathematics.
References
Text book(s): The main text books for the course include A mathematical introduction to logic
by H.B. Enderton, and A course on mathematical logic by S.M. Srivastava.
Some other books which might prove to be helpful are Logic for computer science by M. Huth and M. Ryan, Mathematical logic for computer science by M. Ben-Ari, Modal Logic by P. Blackburn, M. de Rijke and Y. Venema, and Modal Logic for open minds by J. van Benthem.
Some other books which might prove to be helpful are Logic for computer science by M. Huth and M. Ryan, Mathematical logic for computer science by M. Ben-Ari, Modal Logic by P. Blackburn, M. de Rijke and Y. Venema, and Modal Logic for open minds by J. van Benthem.
Grading
Grades are based on mid-semester examination (20%), home assignments (20%), project (10%)
and end-semester examination (50%). The home assignments would include sets of homework
which will be uploaded here at regular intervals, and algorithmic questions. The projects
would be decided along the way depending upon the interests, and the deadline for submission
will be one week after the end-semester examination.
The latex template for the project can be found here.
The latex template for the project can be found here.
Lecture schedule
| 07.01.2026 | Classical Propositional Logic: A brief overview (Class notes) |
| 09.01.2026 | First order logic: Syntax (Class notes) |
| 14.01.2026 | First order logic: Semantics; free and bound variables (Class notes) |
| 16.01.2026 | Definability I (Class notes) |
| 21.01.2026 | Definability II (Class notes) |
| 28.01.2026 | On consequence and satisfiability (Class notes) |
| 30.01.2026 | On deductive consequence (Class notes) |
| 02.02.2026 | Classical Propositional Logic (CPL) (Class notes) |
| 04.02.2026 | CPL: Exploring completeness (Class notes) |
| 06.02.2026 | CPL: Proof systems (Class notes) |
| 16.02.2026 | Substitution and substitutability (Class notes) |
| 18.02.2026 | Towards completeness (Class notes) |
| 19.02.2026 | Finishing completeness (Class notes) |
| 26.02.2026 | MID-SEM EXAM |
| 04.03.2026 | Modal logic: Syntax and semantics (Class notes) |
| 06.03.2026 | Bisimulation (Class notes) |
| 09.03.2026 | Modal logic vs. first order logic (Class notes) |
| 11.03.2026 | Finite model property (Class notes) |
| 13.03.2026 | Decidability (Class notes) |
| 19.03.2026 | Frame characterizations I (Class notes) |
| 20.03.2026 | Frame characterizations II (Class notes) |
| 08.04.2026 | On consequence relations (Class notes) |
| 10.04.2026 | Completeness (Class notes) |
| 11.04.2026 | Propositional Dynamic Logic (PDL) (Class notes) |
| 13.04.2026 | Towards weak completeness (Class notes) |
| 15.04.2026 | Completeness and decidability (Class notes) |
Homeworks/Handouts
Homework 1
Deadline for submission: February 15, 2026.Homework 2
Deadline for submission: March 08, 2026.Homework 3
Deadline for submission: May 15, 2026.