Logic for Computer Science
IIT Delhi, , Prof. S. Arun Kumar
Added to favorite list
Updated On 02 Feb, 19
Introduction - Propositional Logic Syntax - Semantics of Propositional Logic - Logical and Algebraic Concepts - Identities and Normal forms - Tautology Checking - Propositional Unsatisfiability - Analytic Tableaux - Consistency and Completeness - The Completeness Theorem - Maximally Consistent Sets - Formal Theories - Proof Theory : Hilbert-style - Derived Rules - The Hilbert System : Soundness - The Hilbert System :Completeness - Introduction to Predicate Logic - The Semantic of Predicate Logic - Subsitutions.
Models - Structures and Substructures - First - Order Theories - Predicate Logic: Proof Theory (Contd..) - Existential Quantification - Normal Forms - Skalemization - Substitutions and Instantiations - Unification - Resolution in FOL - More on Resolution in FOL - Resolution : Soundness and Completeness - Resolution and Tableaux - Completeness of Tableaux Method - Completeness of the Hilbert System - First -Order Theories - Towards Logic Programming - Verification of Imperative Programs - Verification of WHILE Programs.
4.1 ( 11 )
Logic for CS by Dr. S. Arun Kumar, Department of Computer Science and Engineering, IIT Delhi. For more details on NPTEL visit httpnptel.iitm.ac.in
Sep 12, 2018
Excellent course helped me understand topic that i couldn't while attendinfg my college.
March 29, 2019
Great course. Thank you very much.