Logic for CS

Logic for CS

Logic for CS by Dr. S. Arun Kumar, Department of Computer Science and Engineering, IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in

Mod-01 Lec-01 Introduction

Mod-01 Lec-02 Propositional Logic Syntax

Mod-01 Lec-03 Semantics of Propositional Logic

Mod-01 Lec-04 Logical and Algebraic Concepts

Mod-01 Lec-05 Identities and Normal forms

Mod-01 Lec-06 Tautology Checking

Mod-01 Lec-07 Propositional Unsatisfiability

Mod-01 Lec-08 Analytic Tableaux

Mod-01 Lec-09 Consistency and Completeness

Mod-01 Lec-10 The Completeness Theorem

Mod-01 Lec-11 Maximally Consistent Sets

Mod-01 Lec-12 Formal Theories

Mod-01 Lec-13 Proof Theory : Hilbert-style

Mod-01 Lec-14 Derived Rules

Mod-01 Lec-15 The Hilbert System : Soundness

Mod-01 Lec-16 The Hilbert System :Completeness

Mod-01 Lec-17 Introduction to Predicate Logic

Mod-01 Lec-18 The Semantic of Predicate Logic

Mod-01 Lec-19 Subsitutions

Mod-01 Lec-20 Models

Mod-01 Lec-21 Structures and Substructures

Mod-01 Lec-22 First - Order Theories

Mod-01 Lec-23 Predicate Logic: Proof Theory (Contd..)

Mod-01 Lec-24 Existential Quantification

Mod-01 Lec-25 Normal Forms

Mod-01 Lec-26 Skalemization

Mod-01 Lec-27 Substitutions and Instantiations

Mod-01 Lec-28 Unification

Mod-01 Lec-29 Resolution in FOL

Mod-01 Lec-30 More on Resolution in FOL

Mod-01 Lec-31 Resolution : Soundness and Completeness

Mod-01 Lec-32 Resolution and Tableaux

Mod-01 Lec-33 Completeness of Tableaux Method

Mod-01 Lec-34 Completeness of the Hilbert System

Mod-01 Lec-35 First -Order Theories

Mod-01 Lec-36 Towards Logic Programming

Mod-01 Lec-37 Verification of Imperative Programs

Mod-01 Lec-38 Verification of WHILE Programs

Mod-01 Lec-39 References