Search for tag: "computation"

CL - 6g - CNF II

This video shows how to use a Karnaugh map to represent an arbitrary Boolean function of four variables as a conjunctive normal form (CNF) — a conjunction of disjunctions of literals.

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6f - CNF I

This video shows how blocks of zeros, which correspond to disjund=ctions of literals, lead us to conjunctive normal form (CNF) which we met earlier as the output of our reduction procedure. CNF is in…

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6e - DNF

More on blocks of ones (which correspond to conjunctions of literals).This video shows how to use a Karnaugh map to represent an arbitrary Boolean function of four variables as a disjunctive normal…

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6d - Karnaugh Maps III

More on blocks of ones (which correspond to conjunctions of literals).

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6c - Karnaugh Maps II

This video shows you how to find your way through the state space represented by a Karnaugh Map, and introduces features called blocks. In this video we focus on blocks of ones.

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6b - Karnaugh Maps I

In logic, we call the things in the universal model valuations; they are Boolean-values functions defined on the set of predicates.In computer science we often call these states, because, as we will…

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - 6a - Keeping it Simple

We begin by revisiting the idea of a universal model. If we have only n predicates then we can distinguish only 2n kinds of individual. So we only need to consider 2^{2n} universes. For example, for…

From  Haoran Peng on October 24th, 2020 0 likes 0 plays 0  

CL - Barbara

Gentzen's rules provide a complete system that does not require the cut rule. For many logical systems, cut elimination (showing that uses of the cut rule may be eliminated from any sound proof)…

From  Haoran Peng on October 21st, 2020 0 likes 214 plays 0  

CL - Implication

We derive the implication rule using the rules introduced last week.

From  Haoran Peng on October 20th, 2020 0 likes 293 plays 0  

CL - Sequents

We introduce sequents, where we have finite sets of predicates on both sides of the turnstile.

From  Haoran Peng on October 20th, 2020 0 likes 263 plays 0  

CL - Review 2 - Venn Apples

Venn diagrams on a sphere.

From  Haoran Peng on October 20th, 2020 0 likes 254 plays 0  

CL - Review 1 - Contraposition

We show the intuition of contraposition using Venn diagrams.

From  Haoran Peng on October 20th, 2020 0 likes 275 plays 0  

CL - Q&A - Thursday Week 4

In week 4 we introduced Gentzen's sequents.You should make sure you understand when a sequent is valid, and what it means to provide a counter-example to a sequent -- a universe in which the…

From  Haoran Peng on October 20th, 2020 0 likes 267 plays 0  

FP - Lecture 10 - Expression Trees as Algebraic Data Types

This is the video for the 10th FP lecture.

From  Claudia-Elena Chirita on October 19th, 2020 0 likes 157 plays 0  

FP - Lecture 9 - Expression Trees as Algebraic Data Types

This is the video for the ninth FP lecture on Expression Trees as Algebraic Data Types.

From  Claudia-Elena Chirita on October 18th, 2020 0 likes 242 plays 0  

CL - Lecture 4.k - Logic and Algebra

Last CL video for week 4.

From  Claudia-Elena Chirita on October 15th, 2020 0 likes 259 plays 0