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

Other Resources

Course Curriculum

Introduction Details 50:21
Propositional Logic Syntax Details 40:24
Semantics of Propositional Logic Details 37:41
Logical and Algebraic Concepts Details 48:57
Identities and Normal forms Details 50:24
Tautology Checking Details 49:49
Propositional Unsatisfiability Details 53:9
Analytic Tableaux Details 41:17
Consistency and Completeness Details 54:8
The Completeness Theorem Details 52:39
Maximally Consistent Sets Details 51:20
Formal Theories Details 56:56
Proof Theory : Hilbert-style Details 56:44
Derived Rules Details 54:19
The Hilbert System : Soundness Details 49:31
The Hilbert System :Completeness Details 32:6
Introduction to Predicate Logic Details 51:38
The Semantic of Predicate Logic Details 50:32
Subsitutions Details 46:46
Models Details 53:7
Structures and Substructures Details 43:43
First – Order Theories Details 55:51
Predicate Logic: Proof Theory (Contd..) Details 52:28
Existential Quantification Details 57:44
Normal Forms Details 46:26
Skalemization Details 59:41
Substitutions and Instantiations Details 49:15
Unification Details 50:8
Resolution in FOL Details 58:18
More on Resolution in FOL Details 46:33
Resolution : Soundness and Completeness Details 49:32
Resolution and Tableaux Details 54:14
Completeness of Tableaux Method Details 37:31
Completeness of the Hilbert System Details 51:4
First -Order Theories Details 59:16
Towards Logic Programming Details 58:50
Verification of Imperative Programs Details 54:31
Verification of WHILE Programs Details 55:20
References Details 53:16

This video course is part of NPTEL courses delivered by IIT Delhi.

Course Reviews

N.A

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

About

FreeVideoLectures Provides you complete information about best courses online, Video tutorials, helps you in building a career !!

help@freevideolectures.com

Learn More About us

About Us
Privacy Policy
FAQ

FREEVIDEOLECTURES.COM ALL RIGHTS RESERVED.
top
FreeVideoLectures.com All rights reserved.

Setup Menus in Admin Panel