x
Menu

Logic for Computer Science

IIT Delhi, , Prof. S. Arun Kumar

Updated On 02 Feb, 19

Overview

Contents:
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.

Includes

Lecture 30: More on Resolution in FOL

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

0


0 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