Learn · Discrete Mathematical Structures
Lecture 19 of 40Discrete Structures
Closure Of Relations
Prof. Kamala Krithivasan · IIT Madras
Credits and licence
- From
- Discrete Mathematical Structures, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Propositional Logic
- Propositional Logic (Contd.)
- Predicates & Quantifiers
- Predicates & Quantifiers (Contd.)
- Logical Inference
- Resolution Principles & Application to PROLOG
- Methods of Proof
- Normal Forms
- Proving programs correct (Contd.)
- Sets
- Induction
- Set Operations On Strings
- Relations
- Graphs
- Graphs (Continued)
- Trees
- Trees And Graphs
- Special Properties Of Relations
- Closure Of Relations
- Closure Properties Of Relations
- Order Relations
- Order Relations And Equivalence Relations
- Equivalence Relations And Partitions
- Functions
- Functions (Continued)
- Functions (Continued)
- Pigeonhole Principle
- Permutations And Combinations
- Permutations And Combinations (Continued)
- Generating Functions
- Generating Functions (Continued)
- Recurrence Relations
- Recurrence Relations (Continued)
- Recurrence Relations (Continued)
- Algebras
- Algebras (Continued)
- Algebras (Continued)
- Finite State Automaton
- Finite State Automaton (Continued)
- Lattices