Discrete Mathematical Structures, Lecture 2.2: Tautology and contradiction

preview_player
Показать описание
Discrete Mathematical Structures, Lecture 2.2: Tautology and contradiction.

We begin by motivating the study of Boolean logic with digital circuit, using the AND and OR gates as examples. Next, we define compound Boolean propositions, and discuss the order of operations. A tautology is any proposition that is true for all inputs, and a contradiction is one that is false for all inputs. We give examples of both of these.

UNDER CONSTRUCTION. Completion date: May 2019
Рекомендации по теме
Комментарии
Автор

Thanks for lecture 2.2!!! I now understand lecture 2.1 propositions and logical operators.

julianduron
Автор

'Tautology' comes from the Greek word 'ταυτολογία' which means: 'their logic (λογική) is identical (ταύτο)'. Thanks for the great lectures!! They have helped me a lot as I am trying to learn Discrete Maths.

iliasantonopoulos