InfoCoBuild

Logic for Computer Science

Logic for Computer Science. Instructor: Dr. S. Arun Kumar, Department of Computer Science, IIT Delhi. 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)

Lecture 25 - Normal Forms

Go to the Course Home or watch other lectures:

Lecture 01 - Introduction

Lecture 02 - Propositional Logic Syntax

Lecture 03 - Semantics of Propositional Logic

Lecture 04 - Logical and Algebraic Concepts

Lecture 05 - Identities and Normal Forms

Lecture 06 - Tautology Checking

Lecture 07 - Propositional Unsatisfiability

Lecture 08 - Analytic Tableaux

Lecture 09 - Consistency and Completeness

Lecture 10 - The Completeness Theorem

Lecture 11 - Maximally Consistent Sets

Lecture 12 - Formal Theories

Lecture 13 - Proof Theory: Hilbert-Style

Lecture 14 - Derived Rules

Lecture 15 - The Hilbert System: Soundness

Lecture 16 - The Hilbert System: Completeness

Lecture 17 - Introduction to Predicate Logic

Lecture 18 - The Semantic of Predicate Logic

Lecture 19 - Substitutions

Lecture 20 - Models

Lecture 21 - Structures and Substructures

Lecture 22 - First Order Theories

Lecture 23 - Predicate Logic: Proof Theory (cont.)

Lecture 24 - Existential Quantification

Lecture 25 - Normal Forms

Lecture 26 - Skolemization

Lecture 27 - Substitutions and Instantiations

Lecture 28 - Unification

Lecture 29 - Resolution in First Order Logic

Lecture 30 - More on Resolution in First Order Logic

Lecture 31 - Resolution: Soundness and Completeness

Lecture 32 - Resolution and Tableaux

Lecture 33 - Completeness of Tableaux Method

Lecture 34 - Completeness of the Hilbert System

Lecture 35 - First Order Theories

Lecture 36 - Towards Logic Programming

Lecture 37 - Verification of Imperative Programs

Lecture 38 - Verification of WHILE Programs

Lecture 39 - References