M. Math. / M.Tech.(CS)
ISI Bangalore/Kolkata, 2024-2025 Session

Semester: Even
Instructor: Sujata Ghosh
Meeting Times : Tuesdays, Thursdays 9:00 - 10:45 am
First Class: Tuesday, January 07, 2025
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)

TA

Smiha Samanta
Email: smi1995ha AT gmail DOT com
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.

Pre-requisites (for M.Tech. (CS) students): A course on Discrete Mathematics.


Go to top



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.


Go to top



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.


Go to top



Lecture schedule

07.01.2025 First order logic: Syntax (Class notes)
08.01.2025 First order logic: Semantics (Class notes)
14.01.2025 Free and bound variables (Class notes)
16.01.2025 Definability (Class notes)
18.01.2025 On consequence and satisfiability (Class notes)
21.01.2025 Towards Compactness (Class notes)
23.01.2025 Compactness: Some applications (Class notes)
27.01.2025 On deductive consequence (Class notes)
29.01.2025 Soundness result (Class notes)
13.02.2025 Classical Propositional Logic: Towards completeness (Class notes)
15.02.2025 Classical Propositional Logic: Strong completeness result (Class notes)
21.02.2025 Proving theorems (Class notes)
03.03.2025 MID-SEM EXAM
04.03.2025 Substitution and substitutability (Class notes)
06.03.2025 Towards completeness (Class notes)
07.03.2025 The case of quantified formulas (Class notes)
11.03.2025 Finishing completeness (Class notes)
13.03.2025 Modal logic: Syntax and semantics (Class notes)
18.03.2025 Bisimulation (Class notes)
20.03.2025 Modal logic vs. first order logic (Class notes)
25.03.2025 Finite model property (Class notes)
27.03.2025 Decidability (Class notes)
03.04.2025 A decision procedure (Class notes)
04.04.2025 Correctness (Class notes)
05.04.2025 On frames (Class notes)
08.04.2025 Consequence relation (Class notes)
10.04.2025 Completeness (Class notes)
15.04.2025 Modal logic of transitive closure (Class notes)
17.04.2025 Completeness and decidability (Class notes)


Go to top



Homeworks/Handouts


  • Homework 1
    Deadline for submission: February 12, 2025.

  • Homework 2
    Deadline for submission: March 15, 2025.

  • Homework 3
    Deadline for submission: April 26, 2025.


Go to top