1

Logic for Computer Science. Instructor: Dr. S. Arun Kumar, Department of Computer Science, IIT Delhi.

FREE
This course includes
Hours of videos

1083 years, 2 months

Units & Quizzes

39

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

This course covers lessons on propositional logic syntax and its semantics, tautology checking, analytic tableaux, formal theories, Skolemization, resolution in FOL, verification of white, imperative programs and references. (from nptel.ac.in)

Course Currilcum

  • Lecture 01 – Introduction Unlimited
  • Lecture 02 – Propositional Logic Syntax Unlimited
  • Lecture 03 – Semantics of Propositional Logic Unlimited
  • Lecture 04 – Logical and Algebraic Concepts Unlimited
  • Lecture 05 – Identities and Normal Forms Unlimited
  • Lecture 06 – Tautology Checking Unlimited
  • Lecture 07 – Propositional Unsatisfiability Unlimited
  • Lecture 08 – Analytic Tableaux Unlimited
  • Lecture 09 – Consistency and Completeness Unlimited
  • Lecture 10 – The Completeness Theorem Unlimited
  • Lecture 11 – Maximally Consistent Sets Unlimited
  • Lecture 12 – Formal Theories Unlimited
  • Lecture 13 – Proof Theory: Hilbert-Style Unlimited
  • Lecture 14 – Derived Rules Unlimited
  • Lecture 15 – The Hilbert System: Soundness Unlimited
  • Lecture 16 – The Hilbert System: Completeness Unlimited
  • Lecture 17 – Introduction to Predicate Logic Unlimited
  • Lecture 18 – The Semantic of Predicate Logic Unlimited
  • Lecture 19 – Substitutions Unlimited
  • Lecture 20 – Models Unlimited
  • Lecture 21 – Structures and Substructures Unlimited
  • Lecture 22 – First Order Theories Unlimited
  • Lecture 23 – Predicate Logic: Proof Theory (cont.) Unlimited
  • Lecture 24 – Existential Quantification Unlimited
  • Lecture 25 – Normal Forms Unlimited
  • Lecture 26 – Skolemization Unlimited
  • Lecture 27 – Substitutions and Instantiations Unlimited
  • Lecture 28 – Unification Unlimited
  • Lecture 29 – Resolution in First Order Logic Unlimited
  • Lecture 30 – More on Resolution in First Order Logic Unlimited
  • Lecture 31 – Resolution: Soundness and Completeness Unlimited
  • Lecture 32 – Resolution and Tableaux Unlimited
  • Lecture 33 – Completeness of Tableaux Method Unlimited
  • Lecture 34 – Completeness of the Hilbert System Unlimited
  • Lecture 35 – First Order Theories Unlimited
  • Lecture 36 – Towards Logic Programming Unlimited
  • Lecture 37 – Verification of Imperative Programs Unlimited
  • Lecture 38 – Verification of WHILE Programs Unlimited
  • Lecture 39 – References Unlimited