Logic for CS - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
googlePlay app_img
Logic for CS
broucher Course Brochure
Logic for CS
by Prof S Arun Kumar

The theory of computation is based on concepts defined by logicians and mathematicians such as Alonzo Church and Alan Turing. Church first showed the existence of algorithmically unsolvable problems using his notion of lambda-definability. ... This theory established a precise correspondence between proofs and programs....

0.0  (0 Ratings) 749 Learner
validy img Validity Unlimited
level All Level
level English
cover Img Preview not available
Program Fee
FREE
About This Course

The theory of computation is based on concepts defined by logicians and mathematicians such as Alonzo Church and Alan Turing. Church first showed the existence of algorithmically unsolvable problems using his notion of lambda-definability. ... This theory established a precise correspondence between proofs and programs....

Course Curriculum
1 Sections | 39 Lecture | 33h 40min total length
Expand all sections
Logic for CS

Module 1

| 33h 40min total length
  • <?php echo $alt; ?>

    Semantics of Propositional Logic

    37m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Propositional Logic Syntax

    37m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Introduction

    37m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Logical and Algebraic Concepts

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Identities and Normal forms

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Tautology Checking

    49m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    References

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Verification of WHILE Programs

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Verification of Imperative Programs

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Towards Logic Programming

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    First -Order Theories

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Completeness of the Hilbert System

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Completeness of Tableaux Method

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Resolution and Tableaux

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Resolution : Soundness and Completeness

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    More on Resolution in FOL

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Resolution in FOL

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Unification

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Substitutions and Instantiations

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Skalemization

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Normal Forms

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Existential Quantification

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Predicate Logic: Proof Theory (Contd..)

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    First - Order Theories

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Structures and Substructures

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Models

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Subsitutions

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    The Semantic of Predicate Logic

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Introduction to Predicate Logic

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    The Hilbert System :Completeness

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    The Hilbert System : Soundness

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Derived Rules

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Proof Theory : Hilbert-style

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Formal Theories

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Maximally Consistent Sets

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    The Completeness Theorem

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Consistency and Completeness

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Analytic Tableaux

    53m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Propositional Unsatisfiability

    53m <?php echo $alt; ?>
More Courses by Prof S Arun Kumar

Principles of Programming Languages

by Prof S Arun Kumar
0.0 (0)

2 Enrollments

Validity Unlimited

Free