x
Menu

Logic for CS

IIT Delhi, , Prof. S. Arun Kumar

Overview

Contents:
introduction - Propositional Logic Syntax - Semantics of Propositional Logic - Logical and Algebraic Concepts - Identities and Normal forms - Tautology Checking-Propositional un satisfiability - Analytic Tableaux - Consistency and Completeness - The Completeness Theorem - Maximally Consistent Sets - Formal Theories - Proof Theory - Hilbert-style - Derived Rules - The Hilbert System Soundness,Completeness-Introduction to Predicate Logic-The Semantic of Predicate Logic-Sub situvations- Models

Structures and Substructures - First Order Theories-Predicate Logic: Proof Theory-Existential Quantification - Normal Forms-Scalalemization - 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 - Towards Logic Programming - Verification of Imperative Programs - Verification of WHILE Programs - References

Includes

Lecture 1: Introduction

4.1 ( 11 )


Lecture Details

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

Ratings

3.0


16 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send