Module NameDownload


Sl.No Chapter Name MP4 Download
1Introduction to Mathematical LogicDownload
2Logical EquivalenceDownload
3SAT ProblemDownload
4Rules of InferenceDownload
5ResolutionDownload
6Tutorial 1: Part IDownload
7Tutorial 1: Part IIDownload
8Predicate LogicDownload
9Rules of Inferences in Predicate LogicDownload
10Proof Strategies IDownload
11Proof Strategies IIDownload
12InductionDownload
13Tutorial 2: Part IDownload
14Tutorial 2: Part IIDownload
15SetsDownload
16RelationsDownload
17Operations on RelationsDownload
18Transitive Closure of RelationsDownload
19Warshall’s Algorithm for Computing Transitive ClosureDownload
20Tutorial 3Download
21Equivalence RelationDownload
22Equivalence Relations and PartitionsDownload
23Partial OrderingDownload
24FunctionsDownload
25Tutorial 4: Part IDownload
26Tutorial 4: Part IIDownload
27Countable and Uncountable SetsDownload
28Examples of Countably Infinite SetsDownload
29Cantor’s Diagonalization ArgumentDownload
30Uncomputable FunctionsDownload
31Tutorial 5Download
32Basic Rules of CountingDownload
33Permutation and CombinationDownload
34Counting Using Recurrence EquationsDownload
35Solving Linear Homogeneous Recurrence Equations – Part IDownload
36Solving Linear Homogeneous Recurrence Equations – Part IIDownload
37Tutorial 6: Part IDownload
38Tutorial 6: Part IIDownload
39Solving Linear Non-Homogeneous Recurrence EquationsDownload
40Catalan NumbersDownload
41Catalan Numbers – Derivation of Closed Form FormulaDownload
42Counting Using Principle of Inclusion-ExclusionDownload
43Tutorial 7Download

Sl.No Chapter Name English
1Introduction to Mathematical LogicDownload
Verified
2Logical EquivalenceDownload
Verified
3SAT ProblemDownload
Verified
4Rules of InferenceDownload
Verified
5ResolutionPDF unavailable
6Tutorial 1: Part IPDF unavailable
7Tutorial 1: Part IIPDF unavailable
8Predicate LogicPDF unavailable
9Rules of Inferences in Predicate LogicPDF unavailable
10Proof Strategies IPDF unavailable
11Proof Strategies IIPDF unavailable
12InductionPDF unavailable
13Tutorial 2: Part IPDF unavailable
14Tutorial 2: Part IIPDF unavailable
15SetsPDF unavailable
16RelationsPDF unavailable
17Operations on RelationsPDF unavailable
18Transitive Closure of RelationsPDF unavailable
19Warshall’s Algorithm for Computing Transitive ClosurePDF unavailable
20Tutorial 3PDF unavailable
21Equivalence RelationPDF unavailable
22Equivalence Relations and PartitionsPDF unavailable
23Partial OrderingPDF unavailable
24FunctionsPDF unavailable
25Tutorial 4: Part IPDF unavailable
26Tutorial 4: Part IIPDF unavailable
27Countable and Uncountable SetsPDF unavailable
28Examples of Countably Infinite SetsPDF unavailable
29Cantor’s Diagonalization ArgumentPDF unavailable
30Uncomputable FunctionsPDF unavailable
31Tutorial 5PDF unavailable
32Basic Rules of CountingPDF unavailable
33Permutation and CombinationPDF unavailable
34Counting Using Recurrence EquationsPDF unavailable
35Solving Linear Homogeneous Recurrence Equations – Part IPDF unavailable
36Solving Linear Homogeneous Recurrence Equations – Part IIPDF unavailable
37Tutorial 6: Part IPDF unavailable
38Tutorial 6: Part IIPDF unavailable
39Solving Linear Non-Homogeneous Recurrence EquationsPDF unavailable
40Catalan NumbersPDF unavailable
41Catalan Numbers – Derivation of Closed Form FormulaPDF unavailable
42Counting Using Principle of Inclusion-ExclusionPDF unavailable
43Tutorial 7PDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available