Functionally Complete Set of Connectives || Lesson 13 || Discrete Math & Graph Theory || скачать в хорошем качестве

Functionally Complete Set of Connectives || Lesson 13 || Discrete Math & Graph Theory ||

Functionally Complete Set of Connectives In this class, We discuss a Functionally Complete Set of Connectives. The reader should have prior knowledge of connectives. Click Here. {¬, ∧} and {¬, ∨} are functionally complete set of connectives. A functionally complete set of connectives means we can write any proposition using this set of connectives. {¬, ∧} is a functionally complete set. (p ∨ q) can be written as ¬(¬p ∧¬q) (p -gt q) can be written as (¬p ∨ q) We can change to conjunction once changed to this junction by using the above formula. (p lt-gt q) can be written as (p -gt q) ∧ (q -gt p) Finally, any proposition can be converted to an equivalent proposition containing {¬, ∧} {¬, ∨} is a functionally complete set. (p ∧ q) can be written as ¬(¬p ∨¬q) (p -gt q) can be written as (¬p ∨ q) (p lt-gt q) can be written as (p -gt q) ∧ (q -gt p) Link for playlists:    / @wisdomerscse   Link for our website: https://learningmonkey.in Follow us on Facebook @   / learningmonkey   Follow us on Instagram @   / learningmonkey1   Follow us on Twitter @   / _learningmonkey   Mail us @ [email protected]